An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized

Property Value
dbo:description
  • задача поиска кратчайшего пути во взвешенном графе между двумя вершинами (ru)
  • problèmes classiques mathématiques de la théorie des graphes (fr)
  • Begriff aus der Graphentheorie in der Mathematik (de)
  • laskennallinen ongelma (fi)
  • masalah komputasional (in)
  • nella teoria dei grafi è il cammino minimo tra due vertici e che minimizza la somma dei costi associati all'attraversamento di ciascun lato (it)
  • مسئله‌ای در نظریهٔ گراف (fa)
  • problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized (en)
  • problema que consiste en encontrar un camino entre dos vértices o nodos, de tal manera que la suma de los pesos de las aristas que lo constituyen sea mínima (es)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:chapter
  • Single-Source Shortest Paths and All-Pairs Shortest Paths (en)
dbp:edition
  • 2 (xsd:integer)
dbp:pages
  • 580 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • Shortest path problem (en)
  • مسألة المسار الأقصر (ar)
  • Problema del camí més curt (ca)
  • Kürzester Pfad (de)
  • Problema del camino más corto (es)
  • Problème de plus court chemin (fr)
  • Masalah lintasan terpendek (in)
  • Cammino minimo (it)
  • 最短経路問題 (ja)
  • 최단 경로 문제 (ko)
  • Problem najkrótszej ścieżki (pl)
  • Задача о кратчайшем пути (ru)
  • Problema do caminho mínimo (pt)
  • Задача про найкоротший шлях (uk)
  • 最短路问题 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:class of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International