Connected Graph Searching in Outerplanar Graphs

DOI10.1016/J.ENDM.2005.06.032MaRDI QIDQ3439336zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.032

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Approximation of pathwidth of outerplanar graphs
• Call routing and the ratcatcher
• Chordal embeddings of planar graphs
• Searching is not jumping.

Cited in

(7)

• Finding small-width connected path decompositions in polynomial time
• Connected search for a lazy robber
• Connected graph searching
• Connected searching of weighted trees
• Black virus decontamination of synchronous ring networks by initially scattered mobile agents
• Network decontamination under m-immunity
• An annotated bibliography on guaranteed graph searching

This page was built for publication: Connected Graph Searching in Outerplanar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439336)