Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
Griffith University Author(s)
MetadataShow full item record
International Journal of Computer Mathematics
© 2000 Taylor & Francis : The author-version of this article will be available for download [12-18 months] after publication : Use hypertext link to access the version of the publisher.
History and Archaeology
Computation Theory and Mathematics