The idea for this book came from the time the authors spent at the Statistics and Applied
Mathematical Sciences Institute (SAMSI) in Research Triangle Park in North Carolina …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

Intersection graphs provide theory to underlie much of graph theory. They epitomize graph-
theoretic structure and have their own distinctive concepts and emphasis. They subsume …

With the advent of the Web along with the unprecedented amount of information available in
electronic format, conceptual data analysis is more useful and practical than ever, because …

In this paper we give, for all constantsk, l, explicit algorithms that, given a graphG=(V, E) with
a tree-decomposition ofGwith treewidth at mostl, decide whether the treewidth (or pathwidth) …

We use the notion of potential maximal clique to characterize the maximal cliques appearing
in minimal triangulations of a graph. We show that if these objects can be listed in …

LNCS 4474 - Treewidth: Structure and Algorithms Page 1 Treewidth: Structure and Algorithms
Hans L. Bodlaender Institute of Information and Computing Sciences, Utrecht University, PO …

We present a new approach for designing external graph algorithms and use it to design
simple, deterministic and randomized external algorithms for computing connected …

Any given graph can be embedded in a chordal graph by adding edges, and the resulting
chordal graph is called a triangulation of the input graph. In this paper we study minimal …

Algebraic statistics is a rapidly developing field, where ideas from statistics and algebra
meet and stimulate new research directions. One of the origins of algebraic statistics is the …