Graph searching on chordal graphs

DOI10.1007/BFB0009491zbMath1512.68247MaRDI QIDQ6487435

Sheng-Lung Peng, Ming-Tat Ko, Tsan-sheng Hsu, Chin-Wen Ho, Chuan Yi Tang

Publication date: 25 January 2023

Mathematics Subject Classification ID

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

Related Items (1)

Edge and node searching problems on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. I. Excluding a forest
• Interval graphs and searching
• Min Cut is NP-complete for edge weighted trees
• Narrowness, pathwidth, and their application in natural language processing
• The vertex separation number of a graph equals its path-width
• On the pathwidth of chordal graphs
• Searching and pebbling
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Complexity of Finding Embeddings in a k-Tree
• The complexity of searching a graph
• Monotonicity in graph searching
• Treewidth and pathwidth of permutation graphs
• The Pathwidth and Treewidth of Cographs
• Recontamination does not help to search a graph

This page was built for publication: Graph searching on chordal graphs