Computational Complexity of SRIC and LRIC Indices

DOI10.1007/978-3-030-37157-9_4zbMath1442.90033OpenAlexW3008304397MaRDI QIDQ3294901

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 complexitysimple pathsgroup influenceinfluence in networkslong-range interaction centralityshort-range interaction centrality

Mathematics Subject Classification ID

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

Uses Software

• Algorithm 97
• SLRIC

Cites Work

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

This page was built for publication: Computational Complexity of SRIC and LRIC Indices