Expected linear time MST algorithm

randomized algorithm for computing the minimum spanning forest of a weighted graph

Shapes:

URI: http://yago-knowledge.org/resource/Expected_linear_time_MST_algorithm

Graph visualizationWikidata
Properties
PredicateObject
schema:mainEntityOfPage
  • "https://en.wikipedia.org/wiki/Expected_linear_time_MST_algorithm"^^xsd:anyURI
  • "https://fa.wikipedia.org/wiki/%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85_%D9%85%DB%8C%D8%A7%D9%86%DA%AF%DB%8C%D9%86%E2%80%93%D8%AE%D8%B7%DB%8C_%D8%AF%D8%B1%D8%AE%D8%AA_%D9%BE%D9%88%D8%B4%D8%A7%DB%8C_%DA%A9%D9%85%DB%8C%D9%86%D9%87"^^xsd:anyURI
schema:sameAs
  • "/m/0j9ngld"
rdf:type
rdfs:comment
  • "randomized algorithm for computing the minimum spanning forest of a weighted graph"@en
rdfs:label
  • "Expected linear time MST algorithm"@en
  • "الگوریتم میانگین–خطی درخت پوشای کمینه"@fa
owl:sameAs

Warning: Trying to access array offset on false in /home/yago/website/content/resource.php on line 181