Birkbeck Institutional Research Online
metadata only
Efficient trace frequency queries in sparse graphs
Understanding how a vertex relates to a set of vertices is a fundamental task in graph analysis. Given a graph~$G$ and a vertex set~$X \subseteq V(G)$, consider the collection of subsets of the form~$N(u) \cap X$ where~$u$ ranges over all vertices outside~$X$. These intersections, whi
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
- Exact versus monotone isoperimetric profiles of finitely generated groups#1296978
- Uncovering the Hidden Magnitude of Within-Race/Ethnicity Skin Tone Inequality#486008
- Uncovering the Hidden Magnitude of Within-Race/Ethnicity Skin Tone Inequality#479663
- Verifying Sampling Algorithms via Distributional Invariants / Daniel Zilken, Kevin Batz, Joost-Pieter Katoen, Tobias Winkler#780428
- A General Composition Theorem for Approximate Degree#1078210
Record · ID 1473838
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