arXiv (All)
open access
Faster network motif discovery by counting isomorphic subtrees
We develop a new algorithm for counting the number of subgraphs of a network isomorphic to a given query graph (#SubgraphIsomorphism), motivated by network motif search. High-degree vertices (hubs), common in real-world networks, contribute to a combinatorial explosion in the number of subgraphs, ma
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
- HNSW-MS: Hierarchical Graph Indexing Enables Accurate Real-Time Mass Spectral Similarity Search at Repository Scale#346668
- Exact counting of unlabeled quartic graphs by permutation-cycle aggregation#1106106
- Bounded graph clustering with graph neural networks / Kibidi Neocosmos, Diego Baptista, Nicole Ludwig#661746
- HeTGB: A Comprehensive Benchmark for Heterophilic Text-Attributed Graphs#793418
- HeTGB: A Comprehensive Benchmark for Heterophilic Text-Attributed Graphs#789414
Record · ID 1143287
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