Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902520
DOI10.1007/b93953zbMath1255.68080MaRDI QIDQ5902520
Frances A. Rosamond, Michael R. Fellows, Frank Dehne
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items (5)
Crown reductions for the minimum weighted vertex cover problem ⋮ Inclusion/exclusion meets measure and conquer ⋮ Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting ⋮ Improved parameterized set splitting algorithms: A Probabilistic approach ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness
This page was built for publication: Graph-Theoretic Concepts in Computer Science
