EliScholar
metadata only
Partitioning Bipartite Graphs: A Modified Louvain
Abstract How do we find communities in a graph? How does this change if the graph is bipartite? The Louvain method maximizes links within communities and minimizes those between in order to determine an optimal grouping. Yet, because it may fail when bipartite restrictions are introduced, we have ad
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
- When Edge Importance Disagrees: Resistance-Ranked versus Betweenness Pruning on Urban Road Networks#1077468
- Destroying symmetry by orienting edges: Complete graphs and complete bigraphs#490166
- Small world graphs by iterated local edge formation#492914
- Hypernetwork science via high-order hypergraph walks#1159452
- Cut-offs and their Neighbors#774965
Record · ID 1026938
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