arXiv (All)
open access
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Dynamic connectivity is a fundamental dynamic graph problem, and recent algorithmic breakthroughs on dynamic graph sketching have reshaped what is theoretically possible: by encoding the graph as per-vertex linear sketches, these algorithms solve dynamic connectivity in only $Θ(V \log^2 V)$ space, i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scalable persistence pairing graphs on scalar fields with an application to porous media#1234264
- Explicit Path Routing for Dynamic Multi-Segment Pseudowires#501400
- The optimal search on graph by continuous-time quantum walks#821630
- Algorithmic Simplification for Million-Vertex Diffusion History Reconstruction#622500
- KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators#1063427
Record · ID 1247397
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive