Graph-Theoretic Concepts in Computer Sciences

International Workshop Wg 88 Amsterdam, the Netherlands, June 15-17, 1988. Proceedings (Lecture Notes in Computer Science)

Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today


Buy this book

Last edited by Alan Millar
August 8, 2012 | History

Graph-Theoretic Concepts in Computer Sciences

International Workshop Wg 88 Amsterdam, the Netherlands, June 15-17, 1988. Proceedings (Lecture Notes in Computer Science)

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
Not Avail
Language
English
Pages
459

Buy this book

Book Details


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]."

Classifications

Library of Congress
QA1-939

The Physical Object

Format
Paperback
Number of pages
459

ID Numbers

Open Library
OL9058206M
ISBN 10
3540507280
ISBN 13
9783540507284

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
August 8, 2012 Edited by Alan Millar merge authors
April 28, 2010 Edited by Open Library Bot Linked existing covers to the work.
December 10, 2009 Created by WorkBot add works page