A note on lexicographic breadth first search for chordal graphs
From MaRDI portal
Publication:673001
DOI10.1016/0020-0190(95)00024-7zbMath0875.68533OpenAlexW2004373890MaRDI QIDQ673001
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00024-7
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Generating and characterizing the perfect elimination orderings of a chordal graph, Bayesian networks: the minimal triangulations of a graph
Cites Work
- Unnamed Item
- On rigid circuit graphs
- Decomposition by clique separators
- Incidence matrices and interval graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs