eScholarship
metadata only
Distributed-Memory Breadth-First Search on Massive Graphs
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
- S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs#200508
- Relevant Walk Search for Explaining Graph Neural Networks#222597
- Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)#670343
- Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)#668278
- CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletion#985615
Record · ID 614756
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