This HTML5 document contains 35 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-globalhttps://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Parallel_algorithm
dbo:wikiPageWikiLink
dbr:Parallel_algorithms_for_minimum_spanning_trees
Subject Item
dbr:Parallel_algorithms_for_minimum_spanning_trees
owl:sameAs
dbpedia-global:AQXMo wikidata:Q65073333
rdfs:label
Parallel algorithms for minimum spanning trees
prov:wasDerivedFrom
wikipedia-en:Parallel_algorithms_for_minimum_spanning_trees?oldid=1167969336&ns=0
dbo:wikiPageWikiLink
dbr:Amortized_analysis dbr:Quicksort dbr:Polylogarithmic_function dbc:Spanning_tree dbr:Glossary_of_graph_theory_terms dbr:Sorting_algorithm dbr:Kruskal's_algorithm dbr:Sequential_algorithm dbr:Prim's_algorithm dbr:Edge_contraction dbr:Parallel_algorithm dbr:Tree_(graph_theory) dbr:Asymptotic_computational_complexity dbr:Connected_component_(graph_theory) dbr:Disjoint-set_data_structure dbr:Minimum_spanning_tree dbr:Borůvka's_algorithm dbr:Fibonacci_heap dbr:Priority_queue dbr:Graph_theory dbc:Parallel_computing dbr:Time_complexity dbr:Union_(set_theory) dbr:Parallel_random-access_machine dbr:Ackermann_function
dct:subject
dbc:Spanning_tree dbc:Parallel_computing
foaf:isPrimaryTopicOf
wikipedia-en:Parallel_algorithms_for_minimum_spanning_trees
dbp:wikiPageUsesTemplate
dbt:Reflist
Subject Item
wikipedia-en:Parallel_algorithms_for_minimum_spanning_trees
foaf:primaryTopic
dbr:Parallel_algorithms_for_minimum_spanning_trees