arXiv (All)
open access
Exact computation of the network modularity with branch-and-bound
We consider the computation of the network modularity, a common measure of the structure of networks or graphs that quantifies the division of a network into modules or clusters. The computation of the network modularity is an NP-hard problem, thus making its exact computation often infeasible in pr
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
- Smarandache recursive arithmetic structures: Conjectures, open problems, and computational explorations#691366
- The Fiedler dimension of networks of networks: from fractal to small-world architectures#1249189
- Multiplicative Path Weights in Networks: From Katz Connectivity to Mean First-Passage Times#1356810
- Structural Knowledge Is What Matters in Protein-Ligand Binding Affinity Prediction.#319120
- Transferable Graph Metanetworks#1155355
Record · ID 1200319
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