The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs
From MaRDI portal
Publication:2180175
DOI10.1007/978-3-030-36412-0_36zbMath1435.68228OpenAlexW2994025009MaRDI QIDQ2180175
König Jean-Claude, Benoit Darties, Rodolphe Giroudeau, Valentin Pollet
Publication date: 13 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36412-0_36
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) Connectivity (05C40)
Related Items (3)
Balanced substructures in bicolored graphs ⋮ Complexity and inapproximability results for balanced connected subgraph problem ⋮ The balanced connected subgraph problem
This page was built for publication: The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs
