A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6584561 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
breadth first search | |||
| Property / zbMATH Keywords: breadth first search / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
tree | |||
| Property / zbMATH Keywords: tree / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
outerplanar graph | |||
| Property / zbMATH Keywords: outerplanar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge coloring | |||
| Property / zbMATH Keywords: edge coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
2-distance vertex-distinguishing index | |||
| Property / zbMATH Keywords: 2-distance vertex-distinguishing index / rank | |||
Normal rank | |||
Revision as of 19:09, 27 June 2023
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
