Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:21, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of approximate algorithms for edge-coloring bipartite graphs |
scientific article |
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
