| 书目名称 | Treewidth |
| 副标题 | Computations and App |
| 编辑 | Ton Kloks |
| 视频video | |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | 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. |
| 出版日期 | Book 1994 |
| 关键词 | Algorithmische Graphentheorie; Baumbreite; Computational Graph Theory; Graph; Graph Algorithms; Graph the |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0045375 |
| isbn_softcover | 978-3-540-58356-1 |
| isbn_ebook | 978-3-540-48672-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1994 |
发表于 2025-3-21 18:11:10
