Graph searching on chordal graphs

DOI10.1007/BFB0009491zbMATH Open1512.68247MaRDI QIDQ6487435FDOQ6487435

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

• Min Cut is NP-complete for edge weighted trees
• Searching and pebbling
• Complexity of Finding Embeddings in a k-Tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Title not available (Why is that?)
• The complexity of searching a graph
• Recontamination does not help to search a graph
• Graph minors. I. Excluding a forest
• 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
• Monotonicity in graph searching
• The Pathwidth and Treewidth of Cographs
• Interval graphs and searching
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)