Intervalizing \(k\)-colored graphs (Q4645169)
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 6999423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intervalizing \(k\)-colored graphs |
scientific article; zbMATH DE number 6999423 |
Statements
Intervalizing k-colored graphs (English)
0 references
10 January 2019
0 references
interval graph
0 references
input graph
0 references
linear-time algorithm
0 references
path decomposition
0 references
biconnected component
0 references
0 references
0 references
0 references
0.9758049845695496
0 references
0.8518596291542053
0 references
0.8430718779563904
0 references
0.8277429342269897
0 references
0.7867950797080994
0 references
