Treewidth, Kernels, and Algorithms
Download or Read eBook Treewidth, Kernels, and Algorithms PDF written by Fedor V. Fomin and published by Springer Nature. This book was released on 2020-04-20 with total page 350 pages. Available in PDF, EPUB and Kindle.
| Author | : Fedor V. Fomin |
| Publisher | : Springer Nature |
| Total Pages | : 350 |
| Release | : 2020-04-20 |
| ISBN-10 | : 9783030420710 |
| ISBN-13 | : 303042071X |
| Rating | : 4/5 (10 Downloads) |
Book Synopsis Treewidth, Kernels, and Algorithms by : Fedor V. Fomin
Book excerpt: This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen. Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
