• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time.

Brandon DixonRobert Endre Tarjan
Published in: Algorithmica (1997)
Keyphrases
  • minimum spanning trees
  • worst case
  • spanning tree
  • optimal solution
  • neural network
  • minimum cost
  • active learning
  • upper bound
  • natural images