Adler, I and Krause, PK (2019) A lower bound on the tree-width of graphs with irrelevant vertices. Journal of Combinatorial Theory, Series B, 137. pp. 126-136. ISSN 1096-0902
Abstract
For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function f such that if the tree-width of a graph G with k pairs of terminals is at least f (k), then G contains a solution-irrelevant vertex (Graph Minors. XXII., JCTB 2012). We give a single-exponential lower bound on f . This bound even holds for planar graphs.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2018 Elsevier Inc. This is an author produced version of a paper published in Journal of Combinatorial Theory, Series B. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Disjoint paths problem; Irrelevant vertex; Vital linkage; Unique linkage; Planar graph; Tree-width |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 16 Jan 2019 12:10 |
Last Modified: | 25 Nov 2019 01:41 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.jctb.2018.12.008 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:141087 |