bokomslag Treewidth, Kernels, and Algorithms
Data & IT

Treewidth, Kernels, and Algorithms

Fedor V Fomin Stefan Kratsch Erik Jan Van Leeuwen

Pocket

1199:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 299 sidor
  • 2020
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.
  • Författare: Fedor V Fomin, Stefan Kratsch, Erik Jan Van Leeuwen
  • Format: Pocket/Paperback
  • ISBN: 9783030420703
  • Språk: Engelska
  • Antal sidor: 299
  • Utgivningsdatum: 2020-03-17
  • Förlag: Springer Nature Switzerland AG