A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235)
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: A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs |
scientific article; zbMATH DE number 6584561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs |
scientific article; zbMATH DE number 6584561 |
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
0.8864012360572815
0 references
0.8461280465126038
0 references
0.8268554210662842
0 references
0.8248505592346191
0 references
