ISAAC 2007 - PDF Preprint Papers

ISAAC 2007 International Symposium on Algorithms and Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ISAAC-2007 Paper

click to vote

ISAAC
2007
Springer

183views Algorithms» more ISAAC 2007»

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

14 years 5 months ago

Download www.imsc.res.in

The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	183	The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number	claim
2	158	On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices	claim
3	156	Approximate Range Searching in External Memory	claim
4	146	Bounded Tree-Width and CSP-Related Problems	claim
5	141	Algorithms for the Hypergraph and the Minor Crossing Number Problems	claim
6	135	Fast Evaluation of Union-Intersection Expressions	claim
7	131	On the Fault Testing for Reversible Circuits	claim
8	124	Approximating the Crossing Number of Toroidal Graphs	claim
9	124	Energy Efficient Deadline Scheduling in Two Processor Systems	claim
10	122	Compressing Spatio-temporal Trajectories	claim
11	121	A Constant-Competitive Algorithm for Online OVSF Code Assignment	claim
12	120	Succinct Representation of Labeled Graphs	claim
13	118	Dynamic Structures for Top- k Queries on Uncertain Data	claim
14	113	The Parameterized Complexity of the Unique Coverage Problem	claim
15	111	Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs	claim
16	111	Capacitated Domination Problem	claim
17	109	Manipulation in Games	claim
18	109	A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem	claim
19	109	Separating Populations with Wide Data: A Spectral Analysis	claim
20	108	Checking Value-Sensitive Data Structures in Sublinear Space	claim
21	107	Optimal Triangulation with Steiner Points	claim
22	105	Unbounded-Error Classical and Quantum Communication Complexity	claim
23	102	Depth of Field and Cautious-Greedy Routing in Social Networks	claim
24	100	Dynamic Distance Hereditary Graphs Using Split Decomposition	claim
25	98	More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding	claim
26	98	Width-Optimal Visibility Representations of Plane Graphs	claim
27	97	Average-Case Analysis of Online Topological Ordering	claim
28	95	Hardness and Approximation of Traffic Grooming	claim
29	93	Dilation-Optimal Edge Deletion in Polygonal Cycles	claim
30	92	In-Place Algorithm for Image Rotation	claim
31	92	Using Nash Implementation to Achieve Better Frugality Ratios	claim
32	91	2-Stage Fault Tolerant Interval Group Testing	claim
33	89	Finding Popular Places	claim
34	89	Unifying Two Graph Decompositions with Modular Decomposition	claim
35	84	Geodesic Disks and Clustering in a Simple Polygon	claim
36	80	Geometric Streaming Algorithms with a Sorting Primitive	claim
37	77	On the Relative Dominance of Paging Algorithms	claim
38	70	Kinetic Maintenance of Mobile k-Centres on Trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers