Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00013-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973917240 / rank | |||
Normal rank | |||
Revision as of 00:47, 20 March 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
