Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474)
From MaRDI portal
!
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 2136332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs |
scientific article; zbMATH DE number 2136332 |
Statements
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (English)
0 references
22 February 2005
0 references
Partition refinement
0 references
Interval graphs
0 references
Proper interval graphs
0 references
Minimal triangulations
0 references
AT-free claw-free graphs
0 references
Co-comparability graphs
0 references
Bandwidth
0 references
0 references
0 references
0 references
0.8252031803131104
0 references
0.8175262808799744
0 references
0.8156771063804626
0 references
0.8008877038955688
0 references
