Successive partition of edges of bipartite graph into matchings (Q502001)
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: Successive partition of edges of bipartite graph into matchings |
scientific article; zbMATH DE number 6673343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Successive partition of edges of bipartite graph into matchings |
scientific article; zbMATH DE number 6673343 |
Statements
Successive partition of edges of bipartite graph into matchings (English)
0 references
10 January 2017
0 references
schedule
0 references
bipartite graph
0 references
matching
0 references
queuing
0 references
0 references
0.89819306
0 references
0 references
0 references
0 references
0.8868846
0 references
0.8843116
0 references
0.88262904
0 references
