A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs

DOI10.1007/BF02669835zbMath1012.05148OpenAlexW2019001634MaRDI QIDQ1864209

Kazuo Iwama, Shaohan Ma, Jun Ma, Qian-Ping Gu

Publication date: 17 March 2003

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02669835

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
• Steiner problem in networks: A survey
• An Algorithm for Finding K Minimum Spanning Trees
• Efficiency of a Good But Not Linear Set Union Algorithm
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Finding Minimum Spanning Trees
• Finding All Spanning Trees of Directed and Undirected Graphs
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Unnamed Item

This page was built for publication: A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs