Low-complexity distributed algorithms on large-scale graphs: a brief review

DOI10.13878/J.CNKI.JNUIST.2017.05.012MaRDI QIDQ4640758zbMATH OpenFDO

Authors Ming Ai, Lixiang Qian, Dongxiao Yu, Xuanhua Shi, Hai Jin, Qiang-Sheng Hua

Publication date 25 May 2018

zbMATH Keywords

distributed algorithmcommunication complexitygraph analysisdistributed complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Distributed computation of large-scale graph problems
• Towards a Study of Low-Complexity Graphs
• Computing giant graph diameters
• Distributed graph algorithms and their complexity: an introduction
• Distributed processing of graphs: Fundamental cycles algorithm

Cited in

(3)

• Distributed graph algorithms and their complexity: an introduction
• Distributed computation of large-scale graph problems
• Towards a Study of Low-Complexity Graphs

This page was built for publication: Low-complexity distributed algorithms on large-scale graphs: a brief review

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