Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds |
scientific article |
Statements
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (English)
0 references
28 April 2015
0 references
algorithms
0 references
graph classes
0 references
hole-free graphs
0 references
diamond-free graphs
0 references
LexBFS
0 references
clique separator decomposition
0 references
recognition time bound
0 references
minimal triangulations
0 references
0 references
0 references
0 references
0 references
