Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492904
DOI10.1007/11549345zbMath1156.05331OpenAlexW2494705596MaRDI QIDQ5492904
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
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) Randomized algorithms (68W20)
Related Items (3)
An improved exact algorithm for the domatic number problem ⋮ Multi-constructor CMSA for the maximum disjoint dominating sets problem ⋮ Inclusion/exclusion meets measure and conquer
This page was built for publication: Mathematical Foundations of Computer Science 2005