Unranking and ranking spanning trees of a graph (Q4730795)
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: Unranking and ranking spanning trees of a graph |
scientific article; zbMATH DE number 4115992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unranking and ranking spanning trees of a graph |
scientific article; zbMATH DE number 4115992 |
Statements
Unranking and ranking spanning trees of a graph (English)
0 references
1989
0 references
spanning trees of a graph
0 references
unranking function
0 references
ranking function
0 references
0.8531496524810791
0 references
0.7962306141853333
0 references
0.7876781821250916
0 references
0.7853848934173584
0 references
