New linear time algorithms for generating perfect elimination orderings of chordal graphs

DOI10.1016/0020-0190(96)00013-0zbMath0875.68470OpenAlexW1978587016MaRDI QIDQ1350607

B. S. Panda

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00013-0

zbMATH Keywords

AlgorithmsComplexityChordal graphs

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS ⋮ Restricted unimodular chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some aspects of perfect elimination orderings in chordal graphs
• Interval graphs and related topics
• A characterisation of rigid circuit graphs
• Incidence matrices and interval graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Scheduling Interval-Ordered Tasks
• Polynomially bounded algorithms for locatingp-centers on a tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: New linear time algorithms for generating perfect elimination orderings of chordal graphs