Listing Chordal Graphs and Interval Graphs

DOI10.1007/11917496_7MaRDI QIDQ3522943zbMATH OpenOpenAlexFDO

Authors Masashi Kiyomi, Shuji Kijima, Takeaki Uno

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_7

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Largest Chordal and Interval Subgraphs Faster Than 2 n
• Largest chordal and interval subgraphs faster than \(2^n\)
• Linear-time generation of random chordal graphs
• Efficient enumeration of non-isomorphic interval graphs
• Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph

Cited in

(6)

• Graphic and protographic lists of integers
• Largest chordal and interval subgraphs faster than \(2^n\)
• On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
• LATIN 2004: Theoretical Informatics
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
• On listing, sampling, and counting the chordal graphs with edge constraints

This page was built for publication: Listing Chordal Graphs and Interval Graphs

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