Tight and simple web graph compression for forward and reverse neighbor queries (Q496546)
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: Tight and simple web graph compression for forward and reverse neighbor queries |
scientific article; zbMATH DE number 6484129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight and simple web graph compression for forward and reverse neighbor queries |
scientific article; zbMATH DE number 6484129 |
Statements
Tight and simple web graph compression for forward and reverse neighbor queries (English)
0 references
22 September 2015
0 references
graph compression
0 references
random access
0 references
bidirectional neighbor queries
0 references
0.8693685531616211
0 references
0.854567289352417
0 references
0.8355360627174377
0 references
0.8286904096603394
0 references
0.8069828748703003
0 references
