A Bottom-Up Method and Fast Algorithms for max independent set
From MaRDI portal
Publication:3569879
DOI10.1007/978-3-642-13731-0_7zbMath1285.68060OpenAlexW1490222502WikidataQ56335602 ScholiaQ56335602MaRDI QIDQ3569879
Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, Johan M. M. van Rooij
Publication date: 22 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_7
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms ⋮ Exact algorithms for dominating set ⋮ Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ Exponential Time Complexity of Weighted Counting of Independent Sets
This page was built for publication: A Bottom-Up Method and Fast Algorithms for max independent set
