Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (Q3946187): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0211009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120729889 / rank | |||
Normal rank | |||
Latest revision as of 23:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Edge Coloring Bipartite Graphs and Multigraphs |
scientific article |
Statements
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (English)
0 references
1982
0 references
open shop scheduling
0 references
Euler partition
0 references
minimum edge colorings
0 references
maximum cardinality matching problems
0 references
