The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\) (Q294338)
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: The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in R^n |
scientific article; zbMATH DE number 6593804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\) |
scientific article; zbMATH DE number 6593804 |
Statements
The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\) (English)
0 references
16 June 2016
0 references
computer calculations
0 references
0.8591530919075012
0 references
0.7058876156806946
0 references
0.6896321773529053
0 references
0.6845484972000122
0 references
0.6836732625961304
0 references
