Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 985662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of approximate algorithms for edge-coloring bipartite graphs |
scientific article; zbMATH DE number 985662 |
Statements
Analysis of approximate algorithms for edge-coloring bipartite graphs (English)
0 references
28 February 1997
0 references
Analysis of algorithms
0 references
Edge coloring
0 references
Approximation algorithms
0 references
Scheduling
0 references
Parallel data transfers
0 references
Parallel I/O
0 references
Parallel processing
0 references
0.879429042339325
0 references
0.8599599599838257
0 references
0.8431357741355896
0 references
0.8377618193626404
0 references
