Computational complexity of SRIC and LRIC indices

DOI10.1007/978-3-030-37157-9_4MaRDI QIDQ3294901zbMATH OpenOpenAlexFDO

Authors Sergey Shvydun

Publication date 29 June 2020

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-37157-9_4

zbMATH Keywords

computational complexitygroup influenceinfluence in networkslong-range interaction centralityshort-range interaction centralitysimple paths

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Recommendations

• Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
• Identifying influential nodes in complex networks from global perspective
• Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
• An algorithmic comparison of three scientific impact indices
• Identifying influential nodes in complex networks: a node information dimension approach

Cites work

• A `threshold aggregation' of three-graded rankings
• A course in combinatorics.
• A new status index derived from sociometric analysis
• A note on two problems in connexion with graphs
• A Theorem on Boolean Matrices
• Gaussian elimination is not optimal
• Matrix multiplication via arithmetic progressions
• Power in network structures
• Power indices taking into account the agents' preferences to coalesce

Describes a project that uses

Uses Software

• SLRIC
• Algorithm 97

This page was built for publication: Computational complexity of SRIC and LRIC indices

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