arXiv (OAI Expanded)
open access
Fast and Theoretically-Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps
Parallel batch-dynamic trees are a fundamental building block in recent theoretical and practical advances in dynamic graph algorithms. However, all existing parallel batch-dynamic tree data structures, including Euler tour trees, UFO trees, topology trees, and rake-compress trees, are all significa
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
- Induced subgraphs and tree decompositions XIX. Thetas and forests#927134
- Advanced Data Structures#3554
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#622493
- Structure-Feature Aligned Graph Learning via Alternating Constrained Optimization#363267
- GraphLoom: Reliability-Calibrated Graph Evidence Routing for Multimodal KG-RAG#612486
Record · ID 1084670
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