Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs (Q4229420): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539792224814 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006955534 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 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
