Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
DOI10.1007/978-3-540-85097-7_4zbMATH Open1168.68443OpenAlexW2008217149MaRDI QIDQ5505641FDOQ5505641
Authors: Peter Damaschke 
Publication date: 27 January 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_4
Recommendations
- Multiple hypernode hitting sets and smallest two-cores with targets
- Kernelization Algorithms for d-Hitting Set Problems
- Hitting and covering partially
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
- Can we create large \(k\)-cores by adding few edges?
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Title not available (Why is that?)
- Chordless paths through three vertices
- The steiner problem in graphs
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
Cited In (2)
This page was built for publication: Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505641)
