Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1305411

From MaRDI portal
Publication:4252292
Jump to:navigation, search

zbMATH Open0938.68145MaRDI QIDQ4252292FDOQ4252292

Ka Wong Chong, Tak-Wah Lam, Yijie Han

Publication date: 17 June 1999



Title of this publication is not available (Why is that?)


zbMATH Keywords

minimum spanning trees


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (05C99) Mathematical problems of computer architecture (68M07) Computer system organization (68M99)



Cited In (4)

  • A Parallel Algorithm for Computing Minimum Spanning Trees
  • Improving the efficiency of parallel minimum spanning tree algorithms
  • Expected parallel time and sequential space complexity of graph and digraph problems
  • Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252292)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4252292&oldid=18146159"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 16:32. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki