Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets

DOI10.1007/978-3-540-85097-7_4zbMath1168.68443OpenAlexW2008217149MaRDI QIDQ5505641

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Small cores in 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Chordless paths through three vertices
• Parameterized Algorithms for Hitting Set: The Weighted Case
• Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
• Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
• The steiner problem in graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets