A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-015-0360-X / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-015-0360-X / rank | |||
Normal rank | |||
Latest revision as of 13:30, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs |
scientific article |
Statements
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (English)
0 references
25 May 2016
0 references
breadth first search
0 references
tree
0 references
outerplanar graph
0 references
edge coloring
0 references
2-distance vertex-distinguishing index
0 references
0 references
