scientific article; zbMATH DE number 1796975

MaRDI QIDQ4551369zbMATH OpenFDO

Authors L. Sunil Chandran

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080308

zbMATH Keywords

algorithmsseparators of chorcal graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A linear time algorithm to list the minimal separators of chordal graphs
• An optimal time algorithm for minimum linear arrangement of chord graphs
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• Efficient enumeration of all minimal separators in a graph
• Minimal vertex separators of chordal graphs
• A linear-time algorithm to find a separator in a graph excluding a minor
• Enumerating minimal dominating sets in chordal graphs
• scientific article; zbMATH DE number 4045183
• Efficient algorithms for minimal disjoint path problems on chordal graphs

Cited in

(19)

• Minimal vertex separators of chordal graphs
• Efficient enumeration of all minimal separators in a graph
• Generalized subgraph-restricted matchings in graphs
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
• Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• A Separator Theorem for Chordal Graphs
• The 3-Steiner Root Problem
• How to use the minimal separators of a graph for its chordal triangulation
• scientific article; zbMATH DE number 1420907 (Why is no real title available?)
• Proximity Search for Maximal Subgraph Enumeration
• scientific article; zbMATH DE number 7250384 (Why is no real title available?)
• Disconnected matchings
• Disconnected matchings
• Treewidth versus clique number. II: Tree-independence number
• Comparison of k-creature and t-critter
• Girth and treewidth
• A linear time algorithm to list the minimal separators of chordal graphs
• Counting the number of independent sets in chordal graphs

This page was built for publication:

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