Enumeration algorithm for the edge coloring problem on bipartite graphs (Q6567666)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration algorithm for the edge coloring problem on bipartite graphs |
scientific article; zbMATH DE number 7876616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration algorithm for the edge coloring problem on bipartite graphs |
scientific article; zbMATH DE number 7876616 |
Statements
Enumeration algorithm for the edge coloring problem on bipartite graphs (English)
0 references
5 July 2024
0 references
number of edge colorings
0 references
time complexity of an edge coloring algorithm
0 references
0.9145300388336182
0 references
0.8878712058067322
0 references
0.8850629925727844
0 references
0.8505222797393799
0 references
0.8495180010795593
0 references
