Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree |
scientific article; zbMATH DE number 5915208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree |
scientific article; zbMATH DE number 5915208 |
Statements
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (English)
0 references
30 June 2011
0 references
DE graph
0 references
directed tree
0 references
intersection graph
0 references
kernel
0 references
minimum clique cover
0 references
multicut
0 references
0.765758752822876
0 references
0.7501503229141235
0 references
0.7479944229125977
0 references
