Minimum congestion spanning trees in bipartite and random graphs (Q655852)
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: Minimum congestion spanning trees in bipartite and random graphs |
scientific article; zbMATH DE number 6002317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum congestion spanning trees in bipartite and random graphs |
scientific article; zbMATH DE number 6002317 |
Statements
Minimum congestion spanning trees in bipartite and random graphs (English)
0 references
27 January 2012
0 references
bipartite graph
0 references
random graph
0 references
minimum congestion spanning tree
0 references
0.8405026793479919
0 references
0.8360442519187927
0 references
0.8347539901733398
0 references
0.8301004767417908
0 references
0.8242046236991882
0 references
