|
Showing 1 - 3 of
3 matches in All Departments
This comprehensive textbook presents a clean and coherent account
of most fundamental tools and techniques in Parameterized
Algorithms and is a self-contained guide to the area. The book
covers many of the recent developments of the field, including
application of important separators, branching based on linear
programming, Cut & Count to obtain faster algorithms on tree
decompositions, algorithms based on representative families of
matroids, and use of the Strong Exponential Time Hypothesis. A
number of older results are revisited and explained in a modern and
didactic way. The book provides a toolbox of algorithmic
techniques. Part I is an overview of basic techniques, each chapter
discussing a certain algorithmic paradigm. The material covered in
this part can be used for an introductory course on fixed-parameter
tractability. Part II discusses more advanced and specialized
algorithmic ideas, bringing the reader to the cutting edge of
current research. Part III presents complexity results and lower
bounds, giving negative evidence by way of W[1]-hardness, the
Exponential Time Hypothesis, and kernelization lower bounds. All
the results and concepts are introduced at a level accessible to
graduate students and advanced undergraduate students. Every
chapter is accompanied by exercises, many with hints, while the
bibliographic notes point to original publications and related
work.
|
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers (Paperback, 1st ed. 2021)
Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski
|
R2,785
Discovery Miles 27 850
|
Ships in 10 - 15 working days
|
This book constitutes the proceedings of the 47th International
Workshop on Graph-Theoretic Concepts in Computer Science which was
held during June 23-25, 2021. The conference was planned to take
place in Warsaw, Poland, but changed to an online event due to the
COVID-19 pandemic. The 30 full papers included in this volume were
carefully reviewed and selected from 73 submissions. The conference
aims to merge theory and practice by demonstrating how concepts
from graph theory can be applied to various areas in computer
science or by extracting new graph-theoretic problems from
applications. Chapter "Bears with Hats and Independence
Polynomials" is are available open access under a Creative Commons
Attribution 4.0 International License via link.springer.com.
This comprehensive textbook presents a clean and coherent account
of most fundamental tools and techniques in Parameterized
Algorithms and is a self-contained guide to the area. The book
covers many of the recent developments of the field, including
application of important separators, branching based on linear
programming, Cut & Count to obtain faster algorithms on tree
decompositions, algorithms based on representative families of
matroids, and use of the Strong Exponential Time Hypothesis. A
number of older results are revisited and explained in a modern and
didactic way. The book provides a toolbox of algorithmic
techniques. Part I is an overview of basic techniques, each chapter
discussing a certain algorithmic paradigm. The material covered in
this part can be used for an introductory course on fixed-parameter
tractability. Part II discusses more advanced and specialized
algorithmic ideas, bringing the reader to the cutting edge of
current research. Part III presents complexity results and lower
bounds, giving negative evidence by way of W[1]-hardness, the
Exponential Time Hypothesis, and kernelization lower bounds. All
the results and concepts are introduced at a level accessible to
graduate students and advanced undergraduate students. Every
chapter is accompanied by exercises, many with hints, while the
bibliographic notes point to original publications and related
work.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Hampstead
Diane Keaton, Brendan Gleeson, …
DVD
R66
Discovery Miles 660
|