An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs☆
References (15)
- et al.
A parallel algorithm for eliminating cycles in undirected graphs
Inform. Process. Lett.
(1990) - et al.
An O(log m) parallel algorithm for the minimum spanning tree problem
Inform. Process. Lett.
(1993) An algorithm for finding minimum spanning trees
Inform. Process. Lett.
(1975)- et al.
Algorithms for finding optimum trees: Description, use, and evaluation
Ann. Oper. Res.
(1988) - et al.
Permutation graphs and transitive graphs
J. ACM
(1972) - et al.
Fibonacci heaps and their uses in network optimization algorithms
- et al.
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Combinatorica
(1986)
There are more references available in the full text version of this article.
Cited by (6)
On graphs associated to sets of rankings
2016, Journal of Computational and Applied MathematicsA linear-time algorithm for constructing a spanning tree on circular trapezoid graphs
2013, IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesAn optimal parallel algorithm for constructing a spanning tree on circular permutation graphs
2009, IEICE Transactions on Information and SystemsAn optimal parallel algorithm for constructing a spanning forest on trapezoid graphs
2008, IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesAn efficient algorithm to compute a steiner set and steiner tree on trapezoid graphs
2008, Tamsui Oxford Journal of Information and Mathematical SciencesOptimal sequential and parallel algorithms to compute a steiner tree on permutation graphs
2003, International Journal of Computer Mathematics
- ☆
This work was supported by the National Science Council, Republic of China, under contract NSC-84-2213-E-011-008.
Copyright © 1995 Published by Elsevier B.V.