𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Treewidth computation and extremal combinatorics

✍ Scribed by Fedor V. Fomin, Yngve Villanger

Book ID
118786688
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
262 KB
Volume
32
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Treewidth: Computations and Approximatio
Treewidth: Computations and Approximations
✍ Ton Kloks (eds.) πŸ“‚ Library πŸ“… 1994 πŸ› Springer 🌐 English βš– 1 MB

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

Problems and results in extremal combina
Problems and results in extremal combinatoricsβ€”I
✍ Noga Alon πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 319 KB

Extremal combinatorics is an area in discrete mathematics that has developed spectacularly during the last decades. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers in extremal graph theor