scientific article; zbMATH DE number 751126

MaRDI QIDQ4764622zbMATH OpenFDO

Authors Jean R. S. Blair, Barry W. Peyton

Publication date 4 May 1995

zbMATH Keywords

chordal graphclique-tree representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum average distance clique trees
• scientific article; zbMATH DE number 554762
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
• Counting clique trees and computing perfect elimination schemes in parallel

Cited in

(12)

• Finding minimum height elimination trees for interval graphs in polynomial time
• End simplicial vertices in path graphs
• Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
• A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
• Tree-decompositions with bags of small diameter
• Minimum weight clustered dominating tree problem
• Minimum average distance clique trees
• Minimizing diameters of dynamic trees
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• Moplex orderings generated by the LexDFs algorithm
• Subgraph trees in graph theory
• Intersection graphs of induced subtrees of any graph and a generalization of 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 Q4764622)