What Is This?

This is an HTML+RDFa representation of metadata describing this Web-addressable resource.

Why Is This Important?

The property (attributes and values pairs) links on this page unveil a different kind of link, one which enables the following on HTTP networks such as the Web:

  1. Unambiguous identity for entities (aka. strong identifiers)
  2. Implicit binding of an entity and its metadata via strong identifiers
  3. Multiple metadata representations that enable a variety of presentations
  4. High precision Search and Find queries that simply use the metadata documents (by referencing entity URIs) as the query's Data Source Name

How Do I Discover Alternative Metadata Representations?

This document exposes metadata in the following formats: (X)HTML+RDFa, Turtle, N3, RDF/JSON, or RDF/XML. In the most basic form, you can simply view the (X)HTML source markup of this page, and go directly to the <head/> section which contains a <link/> tag with relationship and type properties for each format.

In addition, you can also explicitly request a desired metadata representation for a given resource via HTTP GET requests that use the entity's strong identifier as the call target.

How Can I Expose My Web Resources In This Manner?

Simply include the following in the <head/> section of your (static or dynamically generated) (X)HTML page:

<link rel="alternate" title="My Data in RDF Linked Data form"
type="application/rdf+xml"
href="http://linkeddata.uriburner.com/about/id/<this-page-URL>/>"

How Is This Related To The Linked Data Meme?

As stated above, the links in this page expose strong identifiers for its primary topic, secondary topics, attributes, and some values. These links, via implicit association, act as conduits to their metadata-bearing documents, in a variety formats.

[OpenLink Software]

About: Minimum spanning tree - Wikipedia

An Entity of Type : Thing, from Data Source : https://en.wikipedia.org/wiki/Minimum_spanning_tree, within Data Space : dev.restore.ovi.cnr.it:8890

  • References
  • Referenced By
content

og:image
  • https://upload.wikimedia.org/wikipedia/commons/thumb/d/d2/Minimum_spanning_tree.svg/1200px-Minimum_spanning_tree.svg.png
  • https://upload.wikimedia.org/wikipedia/commons/thumb/d/d2/Minimum_spanning_tree.svg/640px-Minimum_spanning_tree.svg.png
  • https://upload.wikimedia.org/wikipedia/commons/thumb/d/d2/Minimum_spanning_tree.svg/800px-Minimum_spanning_tree.svg.png
og:image:height
  • 516
  • 645
  • 968
og:image:width
  • 800
  • 1200
  • 640
og:title
  • Minimum spanning tree - Wikipedia
og:type
  • website
Title
  • Minimum spanning tree - Wikipedia
links to
  • https://en.wikipedia.org/wiki/Category:CS1_maint:_location_missing_publisher
  • https://en.wikipedia.org/wiki/Category:Use_American_English_from_April_2019
  • https://en.wikipedia.org/wiki/Decision_tree
  • https://doi.org/10.1145%2F28869.28874
  • https://en.wikipedia.org/wiki/Ronald_Graham
  • https://books.google.com/books?id=hWvmCAAAQBAJ&pg=PA281
  • https://doi.org/10.1007%2F978-3-642-78240-4
  • https://mathscinet.ams.org/mathscinet-getitem?mr=1261419
  • https://en.wikipedia.org/wiki/Triangle_inequality
  • https://en.wikipedia.org/wiki/Arborescence_(graph_theory)
  • https://en.wikipedia.org/wiki/Vertex_(graph_theory)
  • https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)
  • https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing
  • https://en.wikipedia.org/wiki/Computer_vision
  • https://en.wikipedia.org/wiki/Martin_Gr%C3%B6tschel
  • https://en.wikipedia.org/wiki/L%C3%A1szl%C3%B3_Lov%C3%A1sz
  • https://en.wikipedia.org/wiki/Ellipsoid_method
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm
  • https://en.wikipedia.org/wiki/Prim%27s_algorithm
  • https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
  • https://en.wikipedia.org/wiki/Glossary_of_graph_theory#Subgraphs
  • https://en.wikipedia.org/wiki/Alexander_Schrijver
  • https://en.wikipedia.org/wiki/Christos_Papadimitriou
  • https://en.wikipedia.org/wiki/Mihalis_Yannakakis
  • https://wikimediafoundation.org/
  • https://donate.wikimedia.org/?wmf_sour..._campaign=en.wikipedia.org&uselang=en
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
  • https://foundation.wikimedia.org/wiki/...uage/Policy:Universal_Code_of_Conduct
  • https://developer.wikimedia.org
  • https://stats.wikimedia.org/#/en.wikipedia.org
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement
  • https://www.mediawiki.org/
  • https://en.wikipedia.org/wiki/Riemann_zeta_function
  • https://en.wikipedia.org/wiki/ISBN_(identifier)
  • https://en.wikipedia.org/wiki/Doi_(identifier)
  • https://en.wikipedia.org/wiki/Category:CS1_maint:_archived_copy_as_title
  • https://en.wikipedia.org/wiki/Category...escription_is_different_from_Wikidata
  • https://en.wikipedia.org/wiki/S2CID_(identifier)
  • https://en.wikipedia.org/wiki/Category..._articles_written_in_American_English
  • https://en.wikipedia.org/wiki/OCLC_(identifier)
  • https://en.wikipedia.org/wiki/PMID_(identifier)
  • https://en.wikipedia.org/wiki/JSTOR_(identifier)
  • https://en.wikipedia.org/wiki/Computer_network
  • https://en.wikipedia.org/wiki/Telecommunications_network
  • https://en.wikipedia.org/wiki/Parsing
  • https://en.wikipedia.org/wiki/Electrical_grid
  • https://en.wikipedia.org/wiki/Thomas_H._Cormen
  • https://en.wikipedia.org/wiki/Natural_language_processing
  • https://en.wikipedia.org/wiki/Moravia
  • https://en.wikipedia.org/wiki/Process_control
  • https://en.wikipedia.org/wiki/Distributed_computing
  • https://en.wikipedia.org/wiki/Handwriting_recognition
  • https://en.wikipedia.org/wiki/Main_Page
  • https://en.wikipedia.org/wiki/Wikipedia:Contents
  • https://en.wikipedia.org/wiki/Portal:Current_events
  • https://en.wikipedia.org/wiki/Special:Random
  • https://en.wikipedia.org/wiki/Wikipedia:About
  • https://en.wikipedia.org/wiki/Wikipedia:Contact_us
  • https://en.wikipedia.org/wiki/Help:Contents
  • https://en.wikipedia.org/wiki/Help:Introduction
  • https://en.wikipedia.org/wiki/Wikipedia:Community_portal
  • https://en.wikipedia.org/wiki/Special:RecentChanges
  • https://en.wikipedia.org/wiki/Wikipedia:File_upload_wizard
  • https://en.wikipedia.org/wiki/Special:Search
  • https://en.wikipedia.org/wiki/Special:MyContributions
  • https://en.wikipedia.org/wiki/Special:MyTalk
  • https://en.wikipedia.org/wiki/Wikipedia:File_Upload_Wizard
  • https://en.wikipedia.org/wiki/Special:SpecialPages
  • https://en.wikipedia.org/wiki/Template:Cite_web
  • https://en.wikipedia.org/wiki/Help:Category
  • https://en.wikipedia.org/wiki/Category:Articles_with_short_description
  • https://en.wikipedia.org/wiki/Wikipedi...-ShareAlike_4.0_International_License
  • https://en.wikipedia.org/wiki/Wikipedia:General_disclaimer
  • https://en.wikipedia.org/wiki/Category:Commons_category_link_is_on_Wikidata
  • https://en.wikipedia.org/wiki/Big_O_notation
  • https://en.wikipedia.org/wiki/Bibcode_(identifier)
  • https://en.wikipedia.org/wiki/David_Eppstein
  • https://en.wikipedia.org/wiki/W._H._Freeman_and_Company
  • https://en.wikipedia.org/wiki/Template:Citation
  • https://en.wikipedia.org/wiki/Image_segmentation
  • https://en.wikipedia.org/wiki/Feature_extraction
  • https://en.wikipedia.org/wiki/Edsger_W._Dijkstra
  • https://en.wikipedia.org/wiki/Robert_Tarjan
  • https://en.wikipedia.org/wiki/Decision_tree_model
  • https://en.wikipedia.org/wiki/Special:BookSources/978-3-642-78242-8
  • https://en.wikipedia.org/wiki/Broadcasting_(networking)
  • https://en.wikipedia.org/wiki/Central_limit_theorem
  • https://en.wikipedia.org/wiki/Proof_by_contradiction
  • https://www.wikimedia.org/
  • https://en.wikipedia.org/wiki/Directed_graph
  • https://en.wikipedia.org/wiki/Greedy_algorithm
  • https://en.wikipedia.org/wiki/Extended_real_number_line
  • https://mathscinet.ams.org/mathscinet-getitem?mr=0519066
  • https://search.worldcat.org/oclc/247570676
  • https://en.wikipedia.org/wiki/Widest_path_problem
  • https://en.wikipedia.org/wiki/Paul_Seymour_(mathematician)
  • https://en.wikipedia.org/wiki/Information_Processing_Letters
  • https://en.wikipedia.org/wiki/Harold_N._Gabow
  • https://en.wikipedia.org/wiki/Dan_Willard
  • https://doi.org/10.1099%2F00221287-17-1-201
  • https://pubmed.ncbi.nlm.nih.gov/13475686
  • https://en.wikipedia.org/wiki/Frances_Yao
  • https://en.wikipedia.org/wiki/Matching_(graph_theory)
  • https://en.wikipedia.org/wiki/Minimum-cost_spanning_tree_game
  • https://en.wikipedia.org/wiki/MR_(identifier)
  • https://en.wikipedia.org/wiki/Water_supply_network
  • https://en.wikipedia.org/wiki/Cluster_analysis
  • https://en.wikipedia.org/wiki/Hierarchical_clustering
  • https://en.wikipedia.org/wiki/Conditional_random_field
  • https://en.wikipedia.org/wiki/Connected_component_(graph_theory)
  • https://en.wikipedia.org/wiki/Gene_expression
  • https://en.wikipedia.org/wiki/Circuit_design
  • https://en.wikipedia.org/wiki/Path_(graph_theory)
  • https://en.wikipedia.org/wiki/Jaroslav_Ne%C5%A1et%C5%99il
  • https://en.wikipedia.org/wiki/David_S._Johnson
  • https://en.wikipedia.org/wiki/J._Michael_Steele
  • https://en.wikipedia.org/wiki/Observability
  • https://en.wikipedia.org/wiki/P_(complexity)
  • https://en.wikipedia.org/wiki/NP-complete
  • https://en.wikipedia.org/wiki/NP-hard
  • https://en.wikipedia.org/wiki/Taxonomy_(general)
  • https://en.wikipedia.org/wiki/Transport_network
  • https://en.wikipedia.org/wiki/Brute-force_search
  • https://en.wikipedia.org/wiki/Ecotoxicology
  • https://en.wikipedia.org/wiki/Finite_impulse_response
  • https://en.wikipedia.org/wiki/Planar_graph
  • https://en.wikipedia.org/wiki/Complete_graph
  • https://en.wikipedia.org/wiki/Reductio_ad_absurdum
  • https://en.wikipedia.org/wiki/Cycle_(graph_theory)
  • https://en.wikipedia.org/wiki/Otakar_Bor%C5%AFvka
  • https://en.wikipedia.org/wiki/Cut_(graph_theory)
  • https://api.semanticscholar.org/CorpusID:7904683
  • https://en.wikipedia.org/wiki/Euclidean_minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Vojt%C4%9Bch_Jarn%C3%ADk
  • https://en.wikipedia.org/wiki/Decision_problem
  • https://en.wikipedia.org/wiki/Spanning_tree
  • https://en.wikipedia.org/wiki/Traveling_salesman_problem
  • https://en.wikipedia.org/wiki/Parallel_algorithm
  • https://en.wikipedia.org/wiki/Maximum_flow_problem
  • https://en.wikipedia.org/wiki/Introduction_to_Algorithms
  • https://en.wikipedia.org/wiki/Karen_Kafadar
  • https://en.wikipedia.org/wiki/Journal_of_the_Association_for_Computing_Machinery
  • https://en.wikipedia.org/wiki/David_Karger
  • https://en.wikipedia.org/wiki/Single-linkage_clustering
  • https://en.wikipedia.org/wiki/Christofides_algorithm
  • https://en.wikipedia.org/wiki/Minimum_bottleneck_spanning_tree
  • https://en.wikipedia.org/wiki/Reverse-delete_algorithm
  • https://nl.wikipedia.org/wiki/Minimaal_opspannende_boom
  • https://en.wikipedia.org/wiki/Regionalisation
  • https://en.wikipedia.org/wiki/Michael_Garey
  • https://en.wikipedia.org/wiki/Computers_and_Intractability
  • https://en.wikipedia.org/wiki/Special:BookSources/9780716710455
  • https://en.wikipedia.org/wiki/Charles_E._Leiserson
  • https://en.wikipedia.org/wiki/Ronald_L._Rivest
  • https://en.wikipedia.org/wiki/Clifford_Stein
  • https://en.wikipedia.org/wiki/FP_(complexity)
  • https://en.wikipedia.org/wiki/T._C._Hu
  • https://en.wikipedia.org/wiki/Special:BookSources/0-262-03293-7
  • https://en.wikipedia.org/wiki/Connected_graph
  • https://en.wikipedia.org/wiki/Alan_M._Frieze
  • https://en.wikipedia.org/wiki/Hamiltonian_cycle_problem
  • https://en.wikipedia.org/wiki/Ap%C3%A9ry%27s_constant
  • https://en.wikipedia.org/wiki/Image_registration
  • https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences
  • https://en.wikipedia.org/wiki/Michael_Fredman
  • https://en.wikipedia.org/wiki/Pavol_Hell
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Decision_trees
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#bodyContent
  • https://en.wikipedia.org/w/index.php?t...ccount&returnto=Minimum+spanning+tree
  • https://en.wikipedia.org/w/index.php?t...rLogin&returnto=Minimum+spanning+tree
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Properties
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Possible_multiplicity
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Uniqueness
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Minimum-cost_subgraph
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Cycle_property
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Cut_property
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Minimum-cost_edge
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Contraction
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Algorithms
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Classic_algorithms
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Faster_algorithms
  • https://en.wikipedia.org/wiki/Minimum_...near-time_algorithms_in_special_cases
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Dense_graphs
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Integer_weights
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Optimal_algorithm
  • https://en.wikipedia.org/wiki/Minimum_...e#Parallel_and_distributed_algorithms
  • https://en.wikipedia.org/wiki/Minimum_...n_complete_graphs_with_random_weights
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Fractional_variant
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Other_variants
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Applications
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#References
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#Further_reading
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#External_links
  • https://cy.wikipedia.org/wiki/Coeden_rhychwantu_leiaf
  • https://de.wikipedia.org/wiki/Minimaler_Spannbaum
  • https://el.wikipedia.org/wiki/%CE%95%C..._%CE%B4%CE%AD%CE%BD%CF%84%CF%81%CE%BF
  • https://es.wikipedia.org/wiki/%C3%81rbol_recubridor_m%C3%ADnimo
  • https://eo.wikipedia.org/wiki/Minimuma_generanta_arbo
  • https://fa.wikipedia.org/wiki/%D8%AF%D...%DB%8C_%DA%A9%D9%85%DB%8C%D9%86%D9%87
  • https://fr.wikipedia.org/wiki/Arbre_couvrant_de_poids_minimal
  • https://hy.wikipedia.org/wiki/%D5%86%D...%D5%B5%D5%AB%D5%B6_%D5%AE%D5%A1%D5%BC
  • https://hr.wikipedia.org/wiki/Minimalno_razapinju%C4%87e_stablo
  • https://id.wikipedia.org/wiki/Pohon_rentang_minimum
  • https://it.wikipedia.org/wiki/Albero_ricoprente_minimo
  • https://he.wikipedia.org/wiki/%D7%A2%D...E%D7%99%D7%A0%D7%99%D7%9E%D7%9C%D7%99
  • https://hu.wikipedia.org/wiki/Minim%C3%A1lis_fesz%C3%ADt%C5%91fa
  • https://pl.wikipedia.org/wiki/Minimalne_drzewo_rozpinaj%C4%85ce
  • https://pt.wikipedia.org/wiki/%C3%81rvore_de_extens%C3%A3o_m%C3%ADnima
  • https://ro.wikipedia.org/wiki/Arbore_minim_de_acoperire
  • https://ru.wikipedia.org/wiki/%D0%9C%D..._%D0%B4%D0%B5%D1%80%D0%B5%D0%B2%D0%BE
  • https://simple.wikipedia.org/wiki/Minimum_spanning_tree
  • https://sk.wikipedia.org/wiki/Minim%C3%A1lna_kostra_grafu
  • https://sl.wikipedia.org/wiki/Minimalno_vpeto_drevo
  • https://sr.wikipedia.org/wiki/%D0%A0%D...1%D1%82%D0%B5%D0%BF%D0%B5%D0%BD%D0%B0
  • https://sv.wikipedia.org/wiki/Minimalt_uppsp%C3%A4nnande_tr%C3%A4d
  • https://th.wikipedia.org/wiki/%E0%B8%9...D%E0%B8%A2%E0%B8%AA%E0%B8%B8%E0%B8%94
  • https://uk.wikipedia.org/wiki/%D0%9C%D..._%D0%B4%D0%B5%D1%80%D0%B5%D0%B2%D0%BE
  • https://ur.wikipedia.org/wiki/Minimum_spanning_tree
  • https://vi.wikipedia.org/wiki/C%C3%A2y_bao_tr%C3%B9m_nh%E1%BB%8F_nh%E1%BA%A5t
  • https://zh.wikipedia.org/wiki/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91
  • https://www.wikidata.org/wiki/Special:EntityPage/Q240464#sitelinks-wikipedia
  • https://en.wikipedia.org/wiki/Talk:Minimum_spanning_tree
  • https://en.wikipedia.org/w/index.php?title=Minimum_spanning_tree&action=edit
  • https://en.wikipedia.org/w/index.php?title=Minimum_spanning_tree&action=history
  • https://en.wikipedia.org/wiki/Special:WhatLinksHere/Minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Special:RecentChangesLinked/Minimum_spanning_tree
  • https://en.wikipedia.org/w/index.php?t...inimum_spanning_tree&oldid=1287704455
  • https://en.wikipedia.org/w/index.php?title=Minimum_spanning_tree&action=info
  • https://en.wikipedia.org/w/index.php?t...1287704455&wpFormIdentifier=titleform
  • https://en.wikipedia.org/w/index.php?t...ia.org%2Fwiki%2FMinimum_spanning_tree
  • https://en.wikipedia.org/w/index.php?t...ia.org%2Fwiki%2FMinimum_spanning_tree
  • https://en.wikipedia.org/w/index.php?t...ning_tree&action=show-download-screen
  • https://en.wikipedia.org/w/index.php?title=Minimum_spanning_tree&printable=yes
  • https://commons.wikimedia.org/wiki/Category:Minimum_spanning_trees
  • https://www.wikidata.org/wiki/Special:EntityPage/Q240464
  • https://en.wikipedia.org/wiki/Minimum_...¢Â€Â”_Numpy_and_Scipy_documentation-1
  • https://en.wikipedia.org/wiki/Minimum_...e_note-NetworkX_2.6.2_documentation-2
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=1
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=2
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=3
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-3
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=4
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=5
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=6
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=7
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=8
  • https://en.wikipedia.org/wiki/Minimum_...ee#cite_note-PettieRamachandran2002-4
  • https://en.wikipedia.org/w/index.php?t...m_spanning_tree&action=edit§ion=9
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=10
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=11
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#CITEREFKargerKleinTarjan1995
  • https://en.wikipedia.org/wiki/Expected_linear_time_MST_algorithm
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-5
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-6
  • https://en.wikipedia.org/wiki/Soft_heap
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-Chazelle2000-7
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-8
  • https://en.wikipedia.org/wiki/Ackermann_function#Inverse
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=12
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=13
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-9
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-10
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=14
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-11
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=15
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=16
  • https://en.wikipedia.org/w/index.php?title=Seth_Pettie&action=edit&redlink=1
  • https://en.wikipedia.org/wiki/Vijaya_Ramachandran
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=17
  • https://en.wikipedia.org/wiki/Parallel_algorithms_for_minimum_spanning_trees
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-12
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-13
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=18
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-14
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=19
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-:1-15
  • https://en.wikipedia.org/w/index.php?t..._spanning_tree&action=edit§ion=20
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-16
  • https://en.wikipedia.org/wiki/K-minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-17
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-18
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-19
  • https://en.wikipedia.org/wiki/Rectilinear_minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Rectilinear_distance
  • https://en.wikipedia.org/wiki/Capacitated_minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-20
  • https://en.wikipedia.org/wiki/Degree-constrained_spanning_tree
  • https://en.wikipedia.org/wiki/Chu%E2%80%93Liu/Edmonds_algorithm
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-21
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-22
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-23
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree#cite_note-24
xhv:alternate
  • http://dev.restore.ovi.cnr.it:8890/abo...title=Special:RecentChanges&feed=atom
  • https://en.wikipedia.org/w/index.php?title=Special:RecentChanges&feed=atom
  • https://en.m.wikipedia.org/wiki/Minimum_spanning_tree
  • http://dev.restore.ovi.cnr.it:8890/abo...tle=Minimum_spanning_tree&action=edit
  • http://dev.restore.ovi.cnr.it:8890/abo...ipedia.org/wiki/Minimum_spanning_tree
  • https://en.wikipedia.org/w/index.php?title=Minimum_spanning_tree&action=edit
xhv:icon
xhv:license
  • Deed - Attribution-ShareAlike 4.0 International - Creative Commons
xhv:stylesheet
  • http://dev.restore.ovi.cnr.it:8890/abo...e.styles&only=styles&skin=vector-2022
  • http://dev.restore.ovi.cnr.it:8890/abo...ent.init&only=styles&skin=vector-2022
mw:PageProp/toc
primary topic
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree
Alternative Linked Data Views: Facets | iSPARQL | ODE     Raw Linked Data formats: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD
This material is Open Knowledge   W3C Semantic Web Technology     This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3231, on Linux (x86_64-generic_glibc25-linux-gnu), Single Edition