Finding fundamental cycles and bridges on a tree-structured parallel computer
From MaRDI portal
Publication:1093373
DOI10.1016/0020-0255(86)90013-7zbMath0628.68053MaRDI QIDQ1093373
Publication date: 1986
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(86)90013-7
parallel algorithms; undirected graph; bridges; fundamental cycles; tree- structured parallel computer
68R10: Graph theory (including graph drawing) in computer science
Related Items