The NP-completeness column: An ongoing guide
From MaRDI portal
Publication:5902703
DOI10.1016/0196-6774(85)90025-2zbMath0562.68032OpenAlexW4242301326MaRDI QIDQ5902703
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90025-2
Analysis of algorithms and problem complexity (68Q25) Problem books (00A07) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
Memory-efficient enumeration of constrained spanning trees ⋮ The maximum degree \& diameter-bounded subgraph and its applications ⋮ On some multicriteria arborescence problems: Complexity and algorithms ⋮ The Null Space Problem I. Complexity ⋮ On imposing connectivity constraints in integer programs ⋮ On the approximability of some Maximum Spanning Tree Problems ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ The maximum degree and diameter-bounded subgraph in the mesh ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ Complexity and inapproximability results for balanced connected subgraph problem ⋮ The balanced connected subgraph problem
This page was built for publication: The NP-completeness column: An ongoing guide
