arXiv (All)
open access
Equalizing Closeness Centralities via Edge Additions
Graph modification problems with the goal of optimizing some measure of a given node's network position have a rich history in the algorithms literature. Less commonly explored are modification problems with the goal of equalizing positions, though this class of problems is well-motivated from the p
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
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1188420
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1181622
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#999838
- When Edge Importance Disagrees: Resistance-Ranked versus Betweenness Pruning on Urban Road Networks#1077468
- Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors#1227302
Record · ID 1198809
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