An algorithm for testing chordality of graphs
From MaRDI portal
Publication:1216324
DOI10.1016/0020-0190(75)90043-5zbMath0304.05122OpenAlexW2123161490MaRDI QIDQ1216324
Publication date: 1975
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(75)90043-5
Graph theory (05C99) General topics in the theory of software (68N01) Numerical linear algebra (65F99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Recognition of perfect elimination bipartite graphs, Bayesian networks: the minimal triangulations of a graph
Cites Work
- On rigid circuit graphs
- Incidence matrices and interval graphs
- Gaussian elimination is not optimal
- Triangulated graphs and the elimination process
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Toward Characterization of Perfect Elimination Digraphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- A Characterization of Comparability Graphs and of Interval Graphs
