Disjoint multipath closeness centrality

DOI10.1007/S00607-022-01137-7zbMath1522.68380OpenAlexW4311350214MaRDI QIDQ6103302

Dianne S. V. Medeiros, Mariana S. M. Barbosa, Miguel Elias M. Campista

Publication date: 2 June 2023

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-022-01137-7

zbMATH Keywords

closenesscentrality metricsdisjoint multipaths

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (1)

Equilibrium of individual concern-critical influence maximization in virtual and real blending network

Cites Work

• Unnamed Item
• Influence functions of the Spearman and Kendall correlation measures
• Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
• A new local and multidimensional ranking measure to detect spreaders in social networks
• Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs
• STACS 2005

This page was built for publication: Disjoint multipath closeness centrality