Graph-Theoretic Concepts in Computer Science
DOI10.1007/B104584zbMath1112.68433OpenAlexW4211210842MaRDI QIDQ5710819
Marc Demange, Dominique de Werra, Vangelis Th. Paschos, Jérôme Monnot
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104584
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Graph-Theoretic Concepts in Computer Science
