Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10288-010-0150-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008738806 / rank | |||
Normal rank | |||
Revision as of 03:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree |
scientific article |
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
