A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:01, 30 January 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
