Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The greedy algorithm is optimal for on-line edge coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4099676 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A better than “best possible” algorithm to edge color multigraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling parallel I/O operations in multiple bus systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of approximate algorithms for edge-coloring bipartite graphs / rank | |||
Normal rank | |||
Latest revision as of 10:26, 27 May 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
