arXiv (All)
open access
The Power of Bidegeneracy for Hypergraph Data Structures
A hypergraph $H = (V,E)$ describes a set system over a vertex universe $V$. Hypergraphs are increasingly popular in network science, as they represent interactions between subsets of vertices. A natural challenge is to design a data structure for $H$ to quickly answer basic questions about it, e.g.
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
- The Power of Bidegeneracy for Hypergraph Data Structures#1528070
- Graph Homomorphisms and Universal Algebra#1109003
- Arboricity games: the core and the nucleolus#1537054
- Hypergraphs with the smallest Hall ratio are still hard to colour#1355480
- An Error Taxonomy for Property Graph Data#1387371
Record · ID 1611019
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