Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets

DOI10.1007/978-3-540-85097-7_4MaRDI QIDQ5505641zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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?

Cites work

• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Chordless paths through three vertices
• Graph-Theoretic Concepts in Computer Science
• 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

Cited in

(5)

• Small cores in 3-uniform hypergraphs
• A parameterized complexity view on collapsing \(k\)-cores
• A parameterized complexity view on collapsing \(k\)-cores
• Multiple hypernode hitting sets and smallest two-cores with targets
• Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications

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)