Graph-Theoretic Concepts in Computer Sciences
Subtitle: International Workshop Wg 88 Amsterdam, the Netherlands, June 15-17, 1988. Proceedings (Lecture Notes in Computer Science)
Publisher: Not Avail
Published: February 1989
Language: eng
Format: Paperback
Number of pages: 459
ISBN-13: 9783540507284
Subjects: Computer Science; Graphic Methods; Logic Design; Mathematics
First sentence: The class of graphs with treewidth  k has the property that many graph problems, which are NP-complete for arbitrary graphs, become solvable in polynomial time, when restricted to this class [4,3,6,9,18,17].