TL;DR
This paper explores optimal link addition in networks to maximize closeness, analyzing various graph types and optimization criteria to improve network connectivity and efficiency.
Contribution
It introduces a framework for selecting the best link to add in different network structures based on closeness optimization criteria.
Findings
Optimal link addition varies with graph type and criteria.
Cycle and path graphs have distinct optimal strategies.
Connecting complete graphs improves overall network closeness.
Abstract
In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for optimization and different graphs: cycle, paths, lollipop graphs, and two complete graphs, connected by a link.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Optical Network Technologies · Interconnection Networks and Systems