About: Kruskal's algorithm

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Kruskal's algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : fr.dbpedia.org associated with source document(s)

Attributes	Values
rdfs:label	Algorithme de Kruskal (fr) Kruskal's algorithm (en) Thuật toán Kruskal (vi) Алгоритм Краскала (ru) Алгоритм Крускала (uk) クラスカル法 (ja)
rdfs:comment	En informatique, l'algorithme de Kruskal est un algorithme de recherche d'arbre recouvrant de poids minimum (ARPM) ou arbre couvrant minimum (ACM) dans un graphe connexe non-orienté et pondéré. Il a été conçu en 1956 par Joseph Kruskal. (fr)
rdfs:seeAlso	https://commons.wikimedia.org/wiki/Category:Kruskal's_algorithm
sameAs	Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm Kruskal's algorithm
Wikipage page ID	63745 (xsd:integer)
Wikipage revision ID	186800885 (xsd:integer)
dbo:wikiPageWikiLink	Borůvka's algorithm Prim's algorithm Greedy algorithm Algorithmics Tree (set theory) Spanning tree Minimum spanning tree category-fr:Algorithme_de_la_théorie_des_graphes Time complexity dbpedia-fr:Graphe_connexe dbpedia-fr:Graphe_non_orienté Computer science dbpedia-fr:Joseph_Kruskal Mathematical induction dbpedia-fr:Union-find
page length (characters) of wiki page	6955 (xsd:nonNegativeInteger)
dct:subject	category-fr:Algorithme_de_la_théorie_des_graphes
prop-fr:wikiPageUsesTemplate	dbpedia-fr:Modèle:Portail dbpedia-fr:Modèle:Traduction/Référence dbpedia-fr:Modèle:Cormen2fr
prov:wasDerivedFrom	wikipedia-fr:Algorithme_de_Kruskal?oldid=186800885&ns=0
foaf:depiction
thumbnail	wiki-commons:Special:FilePath/Minimum_spanning_tree.svg?width=300
foaf:isPrimaryTopicOf	wikipedia-fr:Algorithme_de_Kruskal
dbo:discoverer	dbpedia-fr:Joseph_Kruskal
named after	dbpedia-fr:Joseph_Kruskal
has abstract	En informatique, l'algorithme de Kruskal est un algorithme de recherche d'arbre recouvrant de poids minimum (ARPM) ou arbre couvrant minimum (ACM) dans un graphe connexe non-orienté et pondéré. Il a été conçu en 1956 par Joseph Kruskal. (fr)
is dbo:wikiPageWikiLink of	dbpedia-fr:Algorithme_De_Kruskal dbpedia-fr:Algorithme_de_kruskal Approximation algorithm Borůvka's algorithm Prim's algorithm Greedy algorithm Spanning tree Minimum spanning tree Enigma (2007 video game) dbpedia-fr:Joseph_Kruskal dbpedia-fr:Kruskal dbpedia-fr:Liste_d'algorithmes dbpedia-fr:Liste_des_algorithmes_de_la_théorie_des_graphes dbpedia-fr:Union-find
is Wikipage redirect of	dbpedia-fr:Algorithme_De_Kruskal dbpedia-fr:Algorithme_de_kruskal
is Wikipage disambiguates of	dbpedia-fr:Kruskal

Faceted Search & Find service v1.16.111 as of Oct 19 2022

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3234 as of May 18 2022, on Linux (x86_64-ubuntu_bionic-linux-gnu), Single-Server Edition (39 GB total memory, 28 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software