Skip to content
Home/ Treewidth: Computations and Approximations (1994)
Treewidth: Computations and Approximations (1994)

Treewidth: Computations and Approximations (1994)

by Kloks, Ton
No customer reviews yet ISBN 9783540583561

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.

About the author

Product details

Pub dateAug 26, 1994
ISBN-103540583564
ISBN-139783540583561
LanguageEnglish
Last updated 2026-09-07 23:54
$57.47
In stock soon — order now to reserve your copy
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Mathematics | Graphic Methods
See all
Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches
<i> <p>Fixed Point Theory and Graph Theory</i> provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. </p> <p>This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. </p> <p>The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.</p>
$115.75
Fast Parallel Algorithms for Graph Matching Problems
Karpinski, Marek
$219.75
Random Geometric Graphs
Penrose, Mathew
$219.75
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$214.27
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$110.03
Graph Decompositions: A Study in Infinite Graph Theory
Diestel, Reinhard
$100.15