Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6431542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds |
scientific article; zbMATH DE number 6431542 |
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
0.7593463659286499
0 references
0.7570188641548157
0 references
0.7569681406021118
0 references
0.756243109703064
0 references
