Vertex Cover Gets Faster and Harder on Low Degree Graphs
DOI10.1007/978-3-319-08783-2_16zbMath1423.68199arXiv1404.5566MaRDI QIDQ2920457
Neeldhara Misra, Sathish Govindarajan, Akanksha Agrawal
Publication date: 26 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5566
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
