Parallel graph algorithms based upon broadcast communications

DOI10.1109/12.61071zbMath1395.68222OpenAlexW1973166355MaRDI QIDQ5375457

Wen-Tsuen Chen, Chang-Biau Yang, Richard Chia-Tung Lee

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a6003da7e89ba780d0807fc70654e766fad9bada

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

A fast maximum finding algorithm on broadcast communication ⋮ Reducing conflict resolution time for solving graph problems in broadcast communications ⋮ A fast maximum finding algorithm on broadcast communication

This page was built for publication: Parallel graph algorithms based upon broadcast communications