Connected Treewidth and Connected Graph Searching

@inproceedings{Fraigniaud2006ConnectedTA,
  title={Connected Treewidth and Connected Graph Searching},
  author={P. Fraigniaud and N. Nisse},
  booktitle={LATIN},
  year={2006}
}
  • P. Fraigniaud, N. Nisse
  • Published in LATIN 2006
  • Mathematics, Computer Science
  • We give a constructive proof of the equality between treewidth and connected treewidth. More precisely, we describe an O(nk3)-time algorithm that, given any n-node width-k tree-decomposition of a connected graph G, returns a connected tree-decomposition of G of width ≤ k. The equality between treewidth and connected treewidth finds applications in graph searching problems. First, using equality between treewidth and connected treewidth, we prove that the connected search number cs(G) of a… CONTINUE READING

    Topics from this paper.

    Connected graph searching in chordal graphs
    • N. Nisse
    • Mathematics, Computer Science
    • 2009
    • 26
    Monotony Properties of Connected Visible Graph Searching
    • 24
    • PDF
    Monotony properties of connected visible graph searching
    • 22
    From Pathwidth to Connected Pathwidth
    • 25
    • PDF
    An annotated bibliography on guaranteed graph searching
    • 306
    • PDF
    Connected searching of weighted trees
    • 24
    • PDF
    Connected graph searching
    • 43
    • PDF
    Graph searching with advice
    • 44
    • PDF
    Graph Searching with Advice
    • 24
    • PDF
    Tree-Decompositions with Connected Clusters for Solving Constraint Networks
    • 16
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES
    Graph Minors. II. Algorithmic Aspects of Tree-Width
    • 1,464
    • Highly Influential
    The Vertex Separation and Search Number of a Graph
    • 222
    • PDF
    Algorithmic graph theory and perfect graphs
    • 3,345
    • Highly Influential
    • PDF
    Graph minors. X. Obstructions to tree-decomposition
    • 645
    • PDF
    The price of connectedness in expansions
    • 22
    • PDF
    The complexity of searching a graph
    • 400
    • PDF
    Characterizations and Algorithmic Applications of Chordal Graph Embeddings
    • 130
    • Highly Influential
    • PDF
    Improved approximation algorithms for minimum-weight vertex separators
    • 263
    • PDF
    Connected and internal graph searching
    • 17
    Call routing and the ratcatcher
    • 338