About this book

Introduction

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.

Keywords

Algorithmische Graphentheorie Baumbreite Computational Graph Theory Graph Graph Algorithms Graph theory Graph-Algorihmen Komplexität Pathwidth Permutation Pfadbreite Treewidth algorithm algorithms complexity

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0045375
  • Copyright Information Springer-Verlag 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-58356-1
  • Online ISBN 978-3-540-48672-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology