On the Path-Width of Planar Graphs.

SIAM Journal on Discrete Mathematics (Impact Factor: 0.58). 01/2009; 23:1311-1316. DOI: 10.1137/060670146
Source: DBLP

ABSTRACT In this paper, we present a result concerning the relation between the path-with of a planar graph and the path-width of its dual. More precisely, we prove that for a 3-connected planar graph G, pw(G) 3pw(G ) + 2. For 4-connected planar graphs, and more generally for Hamiltonian planar graphs, we prove a stronger bound pw(G ) 2 pw(G) + c. The best previously known bound was obtained by Fomin and Thilikos who proved that pw(G ) 6 pw(G) + cte. The proof is based on an algorithm which, given a xed spanning tree of G, transforms any given decomposition of G into one of G. The ratio of the corresponding parameters is bounded by the maximum degree of the spanning tree.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between this game-theoretic approach and graph decompositions called q -branched tree decompositions, which can be interpreted as a parameterized version of tree decompositions. Path decomposition and (standard) tree decomposition are two extreme cases of q-branched tree decompositions. The equivalence between nondeterministic graph searching and q-branched tree decomposition enables us to design an exact (exponential time) algorithm computing q-branched treewidth for all q≥0, which is thus valid for both treewidth and pathwidth. This algorithm performs as fast as the best known exact algorithm for pathwidth. Conversely, this equivalence also enables us to design a lower bound on the amount of nondeterminism required to search a graph with the minimum number of searchers.
    Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings; 01/2005
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been examined for several width-parameters, such as branchwidth, pathwidth, and treewidth. In this paper, we give a direct proof of the self-duality of branchwidth in graphs embedded in some surface. In this direction, we prove that bw(G ) 6 bw(G) + 2g 4 for any graph G embedded in a surface of Euler genus g.
    Discrete Applied Mathematics 10/2011; 159:2184-2186. · 0.68 Impact Factor