Distributed Core Decomposition in Probabilistic Graphs

DOI10.1142/S021759592140008XzbMath1481.90091OpenAlexW3133874239MaRDI QIDQ5024479

No author found.

Publication date: 1 February 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021759592140008x

zbMATH Keywords

distributed algorithmprobabilistic graphcore decomposition

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Uses Software

• Pregel
• MCODE

Cites Work

• \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Fast algorithms for determining (generalized) core groups in social networks
• Statistical mechanics of complex networks

This page was built for publication: Distributed Core Decomposition in Probabilistic Graphs