Finding fundamental cycles and bridges on a tree-structured parallel computer

DOI10.1016/0020-0255(86)90013-7zbMath0628.68053OpenAlexW2171403673MaRDI QIDQ1093373

B. George

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

zbMATH Keywords

parallel algorithmsundirected graphbridgesfundamental cyclestree- structured parallel computer

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Stirling networks: A versatile combinatorial topology for multiprocessor systems

Cites Work

• Unnamed Item
• Graph algorithms on a tree-structured parallel computer
• An \(n^ 2\) algorithm for determining the bridges of a graph
• A parallel algorithm for constructing minimum spanning trees
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Efficient parallel algorithms for some graph problems

This page was built for publication: Finding fundamental cycles and bridges on a tree-structured parallel computer