0 Mėgstami
0Krepšelis

Treewidth: Computations and Approximations

84,68 
84,68 
2025-07-31 84.6800 InStock
Nemokamas pristatymas į paštomatus per 13-17 darbo dienų užsakymams nuo 19,00 

Knygos aprašymas

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.

Informacija

Autorius: Ton Kloks
Serija: Lecture Notes in Computer Science
Leidėjas: Springer Berlin Heidelberg
Išleidimo metai: 1994
Knygos puslapių skaičius: 228
ISBN-10: 3540583564
ISBN-13: 9783540583561
Formatas: Knyga minkštu viršeliu
Kalba: Anglų
Žanras: Discrete mathematics

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „Treewidth: Computations and Approximations“

Būtina įvertinti prekę

Goodreads reviews for „Treewidth: Computations and Approximations“