Finding Dense Subgraphs of Sparse Graphs

DOI10.1007/978-3-642-33293-7_23zbMath1375.68067OpenAlexW204670952MaRDI QIDQ4899257

Christian Komusiewicz, Manuel Sorge

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_23

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Parameterized complexity of immunization in the threshold model ⋮ Parameterized algorithms for graph partitioning problems ⋮ The Parameterized Complexity of the Rainbow Subgraph Problem ⋮ Immunization in the threshold model: a parameterized complexity study ⋮ Improving man-optimal stable matchings by minimum change of preference lists ⋮ The parameterized complexity of the rainbow subgraph problem ⋮ Enumerating connected induced subgraphs: improved delay and experimental comparison ⋮ Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems

This page was built for publication: Finding Dense Subgraphs of Sparse Graphs