Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition

Gozzard, Andrew; Ward, Max; Datta, Amitava

doi:10.1016/j.ins.2017.09.020

Cited by 40 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the algorithm we have presented is much faster than the naive algorithm, it is unclear what the lower bound on the problem is. For example, the edge addition version of the problem has been solved in O(|V | 3 log |V |) time [15]. It is possible that either a faster algorithm is found or a hardness result proves the lower bound on the problem.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Network Analysis Under Single Link Deletion

Ward¹,

Datta²,

Nguyen³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the largest disruption? More formally, given a graph, which edge after deletion disconnects the maximum number of pairs of vertices, where ties for number of pairs disconnected are broken by finding an edge that increases the average shortest path length the maximum amount. This problem is interesting both practically and theoretically. In practice, it is a good tool to measure network robustness and find vulnerable edges. In theory, it is related, though subtly different, to classical problems including the dynamic all-pairs shortest paths problem, and the decremental shortest paths problem.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Recently, a faster solution to the problem of finding a single edge whose addition minimizes the average shortest path length was published [15]. The work presented here tackles the inverse problem.…”

Section: Introductionmentioning

confidence: 99%

Efficient Network Analysis Under Single Link Deletion

Ward¹,

Datta²,

Nguyen³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…the closer to 1, the more efficient). The equation for the average path length calculation is (source: Gozzard et al [60])…”

Section: Methods and Softwarementioning

confidence: 99%

Journal titles and mission statements: Lexical structure, diversity, and readability in business, management and accounting research

Cortés-Sánchez

2021

Journal of Information Science

View full text Add to dashboard Cite

There is an established research agenda on dissecting an article’s components and their association with a journal’s prestige. However, journals’ titles and their overview, aim and scope (i.e. journal’s mission statement – JMS(s)) have not been investigated with the same diligence. This study aims to conduct a comprehensive outlook of titles and JMSs’ lexical structure and identify significant differences between journals prestige and type of access and their JMS content in the field of business, management and accounting (BMA), considering the field’s experience in developing and applying mission statements. Titles and JMSs’ structural analysis reflected current and critical discussion in BMA: a predilection for counterintuitive findings and information and communication technology (ICT) tools. JMSs expressed primarily target customers and markets. JMSs from reputable journals showed a higher betweenness for key-terms related to rigorous features. In contrast, JMSs of lower reputable journals highlighted indexing attributes. The Wilcoxon rank-sum and the Kruskal–Wallis tests showed significant differences in the JMSs’ median diversity regarding the journal’s type of access and best quartiles.

show abstract

“…In this regard, our paper is related to graph augmentation models, which consider the problem of adding edges to a given graph, so that path lengths are reduced. For example, Meyerson and Tagiku [43] study how to add "shortcut edges" to minimize the average shortest path distances, Bilò et al [12] and Demaine and Zadimoghaddam [16] study how to augment a network to reduce its diameter, and there are several interesting results on how to add "ghost edges" to a graph such that it becomes (more) "small world" [25,45,46]. However, these edge additions can be optimized globally and in a biased manner, and hence do not form a matching.…”

Section: Related Workmentioning

confidence: 99%

Online Dynamic B-Matching With Applications to Reconfigurable Datacenter Networks

Bienkowski,

Fuchssteiner,

Marcinkowski

et al. 2020

Preprint

View full text Add to dashboard Cite

This paper initiates the study of online algorithms for the maintaining a maximum weight b-matching problem, a generalization of maximum weight matching where each node has at most b ≥ 1 adjacent matching edges. The problem is motivated by emerging optical technologies which allow to enhance datacenter networks with reconfigurable matchings, providing direct connectivity between frequently communicating racks. These additional links may improve network performance, by leveraging spatial and temporal structure in the workload. We show that the underlying algorithmic problem features an intriguing connection to online paging, but introduces a novel challenge. Our main contribution is an online algorithm which is O(b)-competitive; we also prove that this is asymptotically optimal. We complement our theoretical results with extensive trace-driven simulations, based on real-world datacenter workloads as well as synthetic traffic traces.

show abstract

Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition

Cited by 40 publications

References 8 publications

Efficient Network Analysis Under Single Link Deletion

Efficient Network Analysis Under Single Link Deletion

Journal titles and mission statements: Lexical structure, diversity, and readability in business, management and accounting research

Online Dynamic B-Matching With Applications to Reconfigurable Datacenter Networks

Contact Info

Product

Resources

About