Experimental and Efficient Algorithms
DOI10.1007/B136461zbMath1121.68408OpenAlexW2485841483MaRDI QIDQ5710051
Mark K. Goldberg, Malik Magdon-Ismail, David Hollinger
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Experimental and Efficient Algorithms
