arXiv (All)
open access
SparkAlign: A Star-Hopping Heuristic for Efficient Unsupervised Plain Graph Alignment
Unsupervised plain graph alignment (UPGA) seeks corresponding nodes between two graphs from topology alone, without attributes or seed anchors. The dominant embed-then-match paradigm is expensive on both fronts: it repeatedly retrains node embeddings and then solves a costly global assignment, so it
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
- GPU-Accelerated Multilevel Graph Clustering: A Parallel Perspective on Louvain and Leiden#423934
- SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems#238582
- BiasFlow: Geometric Monitoring and Backbone Regularization for Spurious Feature Reliance#1215925
- BiasFlow: Geometric Monitoring and Backbone Regularization for Spurious Feature Reliance#1194462
- Practices for Scaling ARP and Neighbor Discovery (ND) in Large Data Centers#399177
Record · ID 1232601
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