Parallel graph algorithms for hypercube computers
From MaRDI portal
Recommendations
- Two minimum spanning forest algorithms on fixed-size hypercube computers
- scientific article; zbMATH DE number 4033068
- Parallel algorithms for connectivity problems in graph theory
- Graph algorithms on a tree-structured parallel computer
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
Cited in
(16)- scientific article; zbMATH DE number 1419215 (Why is no real title available?)
- Computing dominators on a cube-connected machine
- Finding fundamental cycles and bridges on a tree-structured parallel computer
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Efficient parallel algorithms for breadth first spanning forests of general graphs
- scientific article; zbMATH DE number 500370 (Why is no real title available?)
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model
- scientific article; zbMATH DE number 1985710 (Why is no real title available?)
- High Parallel Complexity Graphs and Memory-Hard Functions
- Group graphs and computational symmetry on massively parallel architecture
- Two minimum spanning forest algorithms on fixed-size hypercube computers
- Graph-theoretical properties of parallelism in the digital plane
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Graph Problems on a Mesh-Connected Processor Array
- A MULTICAST ALGORITHM FOR HYPERCUBE MULTIPROCESSORS
- Experimental and Efficient Algorithms
This page was built for publication: Parallel graph algorithms for hypercube computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582120)
