A note on lexicographic breadth first search for chordal graphs (Q673001): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Incidence matrices and interval graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition by clique separators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank | |||
Normal rank |
Latest revision as of 11:22, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on lexicographic breadth first search for chordal graphs |
scientific article |
Statements
A note on lexicographic breadth first search for chordal graphs (English)
0 references
28 February 1997
0 references
Analysis of algorithms
0 references
Combinatorial problems
0 references
Graph theory
0 references
Chordal graphs
0 references
Clique separators
0 references