Research map / Learning theory and algorithms / Submodular and game algorithms
Closeness Centrality for Networks with Overlapping Community Structure
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Axiomatic Characterization of Game-Theoretic Network Centralities (AAAI 2017 · similarity 0.87)
- Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming (ICML 2023 · similarity 0.85)
- Axioms for Distance-Based Centralities (AAAI 2018 · similarity 0.84)
- Solving Multiagent Path Finding on Highly Centralized Networks (AAAI 2025 · similarity 0.83)
- An Efficient Local Search Approach for Polarized Community Discovery in Signed Networks (NeurIPS 2025 · similarity 0.82)
- Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time (AAAI 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.