Graph-Theoretic Concepts in Computer Science
Subtitle: 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings (Lecture Notes in Computer Science)
Contributors: Fabrizio D'Amore (Editor); Paolo Giulio Franciosa (Editor); Alberto Marchetti-Spaccamela (Editor)
Edition: 1 edition
Publisher: Springer
Published: March 21, 1997
Language: eng
Format: Paperback
Number of pages: 410
ISBN-13: 9783540625599
Subjects: Applied mathematics; Mathematical theory of computation; Computers - General Information; Computer Graphics - General; Computers; Computer Books: General; Discrete Mathematics; Computer Science; Bäume; Computers / Computer Science; Graph-Algorithmen; Hypergraphen; Kombinatorische Optimierung; Netzwerk-Graphen; combinatorial optimization; graph algorithms; hypergraphs; networking; trees
First sentence: It is widely known that many NP-complete graph problems remain NP-complete even if restricted to bounded degree and regular graphs [3].