Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902532
DOI10.1007/B93953zbMath1255.68083MaRDI QIDQ5902532
Daniël Paulusma, Asaf Levin, Gerhard J. Woeginger
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Graph-Theoretic Concepts in Computer Science
