Graph searching on chordal graphs

DOI10.1007/BFB0009491MaRDI QIDQ6487435zbMATH OpenFDO

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

Publication date 25 January 2023

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 4173000 (Why is no real title available?)
• scientific article; zbMATH DE number 4147519 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Complexity of Finding Embeddings in a k-Tree
• Graph minors. I. Excluding a forest
• Interval graphs and searching
• Min Cut is NP-complete for edge weighted trees
• Monotonicity in graph searching
• Narrowness, pathwidth, and their application in natural language processing
• On the pathwidth of chordal graphs
• Recontamination does not help to search a graph
• Searching and pebbling
• The Pathwidth and Treewidth of Cographs
• The complexity of searching a graph
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The vertex separation number of a graph equals its path-width
• Treewidth and pathwidth of permutation graphs

Cited in

(1)

• Edge and node searching problems on trees

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

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