Treewidth lower bounds with brambles

Algorithmica (New York)

Volumn 51, Issue 1, 2008, Pages 81-98

  Bodlaender, Hans L ^a   Grigoriev, Alexander ^b   Koster, Arie M C A ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Approximation algorithm; Bramble; Grid minor; Lower bound; Planar graph; Treewidth

Indexed keywords

BRANCHWIDTH; GRID MINOR; LOWER BOUND; PLANAR GRAPHS; TREEWIDTH;

APPROXIMATION ALGORITHMS; BRANCH AND BOUND METHOD; COMPUTATIONAL METHODS; GRAPH THEORY; PROBLEM SOLVING;

DECISION TREES;

EID: 43449087368     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9056-z     Document Type: Article

References (41)