Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs (Q4229420): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57535766, #quickstatements; #temporary_batch_1706364719135 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57535766 / rank | |||
Normal rank | |||
Revision as of 15:20, 27 January 2024
scientific article; zbMATH DE number 1252582
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs |
scientific article; zbMATH DE number 1252582 |
Statements
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs (English)
0 references
22 February 1999
0 references
chordal graph
0 references
triangulated graph
0 references
interval graph
0 references
analysis of algorithms
0 references
graph theory
0 references
substitution decomposition
0 references
modular decomposition
0 references
cycle-free poset
0 references
transitive orientation
0 references
graph partitioning
0 references
cardinality lexicographic ordering
0 references
graph recognition
0 references
