The permutation-path coloring problem on trees. (Q1401295): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00635-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992627018 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The permutation-path coloring problem on trees. |
scientific article |
Statements
The permutation-path coloring problem on trees. (English)
0 references
17 August 2003
0 references
Average-case complexity
0 references
Routing permutation
0 references
Path coloring
0 references
Tree networks
0 references
NP-completeness
0 references
0 references
