Two methods for the generation of chordal graphs

DOI10.1007/S10479-007-0190-4MaRDI QIDQ940844zbMATH OpenOpenAlexFDO

Authors Lilian Markenzon, O. Vernet, 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 graphsclique-treedynamic algorithmsgraph generation

Mathematics Subject Classification ID

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

Recommendations

• Linear-time generation of random chordal graphs
• Generation of random chordal graphs using subtrees of a tree
• Fully dynamic algorithms for chordal graphs and split graphs
• Algorithms for generating strongly chordal graphs
• A vertex incremental approach for maintaining chordality

Cites work

• Algorithmic aspects in speech recognition
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms and Computation
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Clique tree generalization and new subclasses of chordal graphs
• Fully dynamic algorithms for chordal graphs and split graphs
• Generating and characterizing the perfect elimination orderings of a chordal graph
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 15335 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1744078 (Why is no real title available?)
• Sparsification—a technique for speeding up dynamic graph algorithms
• Two methods for the generation of chordal graphs

Cited in

(13)

• 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
• Sequential sampling of junction trees for decomposable graphs
• Algorithms for generating strongly chordal graphs
• Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
• Fast causal orientation learning in directed acyclic graphs
• scientific article; zbMATH DE number 3970806 (Why is no real title available?)
• Generation of random chordal graphs using subtrees of a tree
• Linear-time generation of random chordal graphs
• A separator-based method for generating weakly chordal graphs
• A biased random-key genetic algorithm for the chordal completion problem
• Cayley trees and increasing 1, 2-trees: let's twist!
• Two methods for the generation of chordal graphs

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

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