Conflict-free broadcasting algorithms for graph traversals and their applications

DOI10.1016/0167-8191(92)90139-XzbMath0792.68128OpenAlexW2099740743MaRDI QIDQ1195181

Wei-Wen Liang, Gen-Huey Chen

Publication date: 7 October 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90139-x

zbMATH Keywords

connected componentsbridgesbreadth first searchspanning treesdepth first searcharticulation pointsconflict-free broadcasting algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Conflict-free broadcasting algorithms for graph traversals and their applications