A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493)
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 parallel algorithm for edge-coloring of graphs with edge-disjoint cycles |
scientific article; zbMATH DE number 69907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles |
scientific article; zbMATH DE number 69907 |
Statements
A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (English)
0 references
29 November 1992
0 references
design and analysis of algorithms
0 references
optimal algorithm
0 references
parallel algorithms
0 references
linear algorithm
0 references
parallelization
0 references
edge-coloring
0 references
tree contraction
0 references
0.8667057156562805
0 references
0.8517935872077942
0 references