arXiv (All)
open access
Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance
Hypergraphs model interactions involving groups of entities, and finding highly connected groups is a fundamental task in analyzing these data. When interactions arrive and expire, maintaining a dense group can require frequent and expensive changes to the underlying representation. We propose CAP,
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 Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance#1169674
- Consilience-Driven Automated Scientific Inference on Multilayer Knowledge Hypergraphs: Cross-Domain Intersections of Mathematical Physics, Biomedicine, and Geomythology#290378
- A Phase Transition for Small Dense Subhypergraphs#1049456
- Fast approximate shortest paths in the congested clique#301330
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
Record · ID 1144945
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