The following pages link to Graph compression by BFS (Q1662490):
Displaying 8 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- Multiscale approach for the network compression-friendly ordering (Q553960) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- Summarizing and understanding large graphs (Q4970005) (← links)
- Fast Construction of Compressed Web Graphs (Q5150926) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
