Problemresearch
Graph compression
Also called web graph compression.
Store a large graph in as few bits as possible while supporting neighbour queries.
Store a large graph in as few bits as possible while supporting neighbour queries.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag GWX6WX Edit this page History Report an error