Treewidth : computations and approximations /

Saved in:

Bibliographic Details
Author / Creator:	Kloks, Ton.
Imprint:	Berlin : Springer-Verlag, 1994.
Description:	1 online resource (ix, 209 pages :) : illustrations
Language:	English
Series:	Lecture notes in computer science ; 842.
Subject:	Trees (Graph theory) -- Data processing. Trees (Graph theory) -- Data processing.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11065784

Hidden Bibliographic Details
ISBN:	9783540486725 3540486720 0387583564 9780387583563 3540583564 9783540583561
Notes:	Gedeeltelijk herziene uitg. van proefschr. Utrecht, 1993. Includes bibliographical references (pages 193-206) and index.
Summary:	This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph. D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
Other form:	Print version: Treewidth

Similar Items