Treewidth computation and extremal combinatorics (English)
- New search for: Fomin, Fedor V.
- New search for: Villanger, Yngve
- New search for: Fomin, Fedor V.
- New search for: Villanger, Yngve
In:
Combinatorica
;
32
, 3
;
289-308
;
2012
- Article (Journal) / Electronic Resource
-
Title:Treewidth computation and extremal combinatorics
-
Contributors:Fomin, Fedor V. ( author ) / Villanger, Yngve ( author )
-
Published in:Combinatorica ; 32, 3 ; 289-308
-
Publisher:
- New search for: Springer-Verlag
-
Place of publication:Berlin/Heidelberg
-
Publication date:2012-04-01
-
Size:20 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 32, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 251
-
Packing seagullsChudnovsky, Maria / Seymour, Paul et al. | 2012
- 283
-
Finding minimum clique capacityChudnovsky, Maria / Oum, Sang-Il / Seymour, Paul et al. | 2012
- 289
-
Treewidth computation and extremal combinatoricsFomin, Fedor V. / Villanger, Yngve et al. | 2012
- 309
-
Applications of character estimates to statistical problems for the symmetric groupSchlage-Puchta, Jan-Christoph et al. | 2012
- 325
-
Universality among graphs omitting a complete bipartite graphShelah, Saharon et al. | 2012
- 363
-
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and FürediTao, Terence / Vu, Van et al. | 2012