Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Q4840219)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 777607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems |
scientific article; zbMATH DE number 777607 |
Statements
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (English)
0 references
11 April 1996
0 references
succinct encoding
0 references
0.8635051846504211
0 references
0.7486391067504883
0 references
0.7480131387710571
0 references
0.7475751042366028
0 references
0.746553361415863
0 references
