Algorithms and Data Structures
From MaRDI portal
Publication:5394236
DOI10.1007/11534273zbMath1161.68669MaRDI QIDQ5394236
Rolf Niedermeier, Jiong Guo, Sebastian Wernicke
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Improved Upper Bounds for Partial Vertex Cover, Enumerate and expand: Improved algorithms for connected vertex cover and tree cover, Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles, On the minimum feedback vertex set problem: Exact and enumeration algorithms, Vertex and edge covers with clustering properties: Complexity and algorithms, On problems without polynomial kernels, Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, A Purely Democratic Characterization of W[1], Complexity and Approximation Results for the Connected Vertex Cover Problem, Faster Steiner Tree Computation in Polynomial-Space, Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
