Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Treewidth: Computations and Approximations - Ton Kloks

Anglų
1994-08-26
63,51 € 84,68 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 12-18 d.d.

30 dienų grąžinimo politika

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 smo ... Visas aprašymas

Jums taip pat gali patikti

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.

Daugiau informacijos

Autorius Ton Kloks
Leidėjas Springer Berlin Heidelberg
Series Lecture Notes in Computer Science
Išleidimo metai 1994
Viršelio tipas Minkšti viršeliai
EAN 9783540583561
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Treewidth: Computations and Approximations
Jūsų įvertinimas:

Goodreads Atsiliepimai

63,51 € 84,68 €