Reducing conflict resolution time for solving graph problems in broadcast communications

DOI10.1016/0020-0190(91)90197-PzbMath0743.94008MaRDI QIDQ1183491

Chang-Biau Yang

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

graphparallel algorithmstime complexitybreadth-first searchconnected componenttopological orderingbroadcast communication model

Mathematics Subject Classification ID

Communication theory (94A05)

Related Items (3)

A fast maximum finding algorithm on broadcast communication ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ A fast maximum finding algorithm on broadcast communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prallel algorithms for analyzing activity networks
• Parallel computation and conflicts in memory access
• Tree algorithms for packet broadcast channels
• Parallel Matrix and Graph Algorithms
• Parallel graph algorithms based upon broadcast communications

This page was built for publication: Reducing conflict resolution time for solving graph problems in broadcast communications