Algorithmadvanced
AGM graph sketch
Also called Ahn-Guha-McGregor sketch, linear graph sketching.
Linear sketches of vertex incidence vectors that recover a spanning forest under edge deletions.
Linear sketches of vertex incidence vectors that recover a spanning forest under edge deletions.
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 25M25W Edit this page History Report an error