Pages that link to "Item:Q496546"
From MaRDI portal
The following pages link to Tight and simple web graph compression for forward and reverse neighbor queries (Q496546):
Displaying 5 items.
- Simple efficient graph compression schemes for dense and complement graphs (Q1288471) (← links)
- Graph compression by BFS (Q1662490) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- Reachability preserving compression for dynamic graph (Q2660982) (← links)
- Models for the Compressible Web (Q5396946) (← links)