Disjoint multipath closeness centrality

DOI10.1007/S00607-022-01137-7MaRDI QIDQ6103302zbMATH OpenOpenAlexFDO

Authors Mariana S. M. Barbosa, Dianne S. V. Medeiros, 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

centrality metricsclosenessdisjoint multipaths

Mathematics Subject Classification ID

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

Recommendations

• Finding critical links for closeness centrality
• Closeness centrality in some splitting networks
• Residual closeness and generalized closeness
• Closeness centrality in neural and interconnection networks
• Localized bridging centrality

Cites work

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

Cited in

(1)

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

This page was built for publication: Disjoint multipath closeness centrality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103302)