Two methods for the generation of chordal graphs

DOI10.1007/s10479-007-0190-4zbMath1151.05332OpenAlexW2021389178MaRDI QIDQ940844

Oswaldo Vernet, Lilian Markenzon, Luiz Henrique Araujo

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11422/1930

zbMATH Keywords

chordal graphsdynamic algorithmsclique-treegraph generation

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Linear-Time Generation of Random Chordal Graphs ⋮ Fast causal orientation learning in directed acyclic graphs ⋮ Algorithms for generating strongly chordal graphs ⋮ Two methods for the generation of chordal graphs ⋮ The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation ⋮ An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs ⋮ Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods ⋮ Sequential sampling of junction trees for decomposable graphs ⋮ A separator-based method for generating weakly chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two methods for the generation of chordal graphs
• Clique tree generalization and new subclasses of chordal graphs
• Generating and characterizing the perfect elimination orderings of a chordal graph
• Algorithmic Aspects of Vertex Elimination on Graphs
• Sparsification—a technique for speeding up dynamic graph algorithms
• Fully dynamic algorithms for chordal graphs and split graphs
• Algorithms and Computation
• Algorithmic aspects in speech recognition
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: Two methods for the generation of chordal graphs