About: K shortest path routing

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The k shortest path routing problem is a generalization of the shortest path routing problem in a given network. It asks not only about a shortest path but also about next k−1 shortest paths (which may be longer than the shortest path). A variation of the problem is the loopless k shortest paths. Finding k shortest paths is possible by extending Dijkstra algorithm or Bellman-Ford algorithm.

Property	Value
dbo:abstract	The k shortest path routing problem is a generalization of the shortest path routing problem in a given network. It asks not only about a shortest path but also about next k−1 shortest paths (which may be longer than the shortest path). A variation of the problem is the loopless k shortest paths. Finding k shortest paths is possible by extending Dijkstra algorithm or Bellman-Ford algorithm. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/15-node_network_conta...d_uni-directional_links.png?width=300
dbo:wikiPageExternalLink	http://cvlab.epfl.ch/software/ksp/ http://www.technical-recipes.com/2012/the-k-shortest-paths-algorithm-in-c/%23more-2432 http://raweb.inria.fr/rapportsactivite/RA2009/aspi/uid62.html https://gitlab.inria.fr/dcoudert/k-shortest-simple-paths/ https://web.archive.org/web/20120506201524/http:/bioinformatics.oxfordjournals.org/content/21/16/3401.full.pdf%3Fkeytype=ref&ijkey=LBKAnjRh0mW0xP4 https://web.archive.org/web/20130108024800/http:/cvlab.epfl.ch/publications/publications/2011/BerclazFTF11.pdf http://code.google.com/p/k-shortest-paths/
dbo:wikiPageID	37804593 (xsd:integer)
dbo:wikiPageLength	12574 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1111601285 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Bellman–Ford_algorithm dbr:David_Eppstein dbr:Pseudo-polynomial_time dbr:Network_theory dbr:Constrained_Shortest_Path_First dbr:Optical_mesh_network dbr:Computational_linguistics dbr:John_Hershberger dbr:Perturbation_theory dbr:Subhash_Suri dbc:Graph_algorithms dbr:Johnson's_algorithm dbc:Polynomial-time_problems dbr:Breadth-first_search dbr:Floyd–Warshall_algorithm dbr:Big_O_notation dbc:Computational_problems_in_graph_theory dbr:Edge_(geometry) dbc:Network_theory dbr:Vertex_(graph_theory) dbr:Yen's_algorithm dbr:Asymptotic_time_complexity dbr:Simple_graph dbr:Shortest-path_routing dbr:Shortest_path_algorithms dbr:Sparse_graph dbr:Dijkstra_algorithm dbr:File:15-node_network_containing_a_comb...ctional_and_uni-directional_links.png
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description
dcterms:subject	dbc:Graph_algorithms dbc:Polynomial-time_problems dbc:Computational_problems_in_graph_theory dbc:Network_theory
gold:hypernym	dbr:Algorithm
rdf:type	dbo:Software yago:WikicatComputationalProblemsInGraphTheory yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Attribute100024264 yago:Condition113920835 yago:Difficulty114408086 yago:Event100029378 yago:Problem114410605 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:WikicatGraphAlgorithms yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:State100024720 yago:WikicatPolynomial-timeProblems
rdfs:comment	The k shortest path routing problem is a generalization of the shortest path routing problem in a given network. It asks not only about a shortest path but also about next k−1 shortest paths (which may be longer than the shortest path). A variation of the problem is the loopless k shortest paths. Finding k shortest paths is possible by extending Dijkstra algorithm or Bellman-Ford algorithm. (en)
rdfs:label	K shortest path routing (en)
owl:sameAs	freebase:K shortest path routing yago-res:K shortest path routing wikidata:K shortest path routing dbpedia-sr:K shortest path routing https://global.dbpedia.org/id/4ooBD
prov:wasDerivedFrom	wikipedia-en:K_shortest_path_routing?oldid=1111601285&ns=0
foaf:depiction	wiki-commons:Special:FilePath/15-node_network_conta...ctional_and_uni-directional_links.png
foaf:isPrimaryTopicOf	wikipedia-en:K_shortest_path_routing
is dbo:wikiPageDisambiguates of	dbr:KSP
is dbo:wikiPageRedirects of	dbr:Eppstein's_algorithm
is dbo:wikiPageWikiLink of	dbr:Optical_mesh_network dbr:Shortest_path_problem dbr:Eppstein's_algorithm dbr:Hexagonal_Efficient_Coordinate_System dbr:Fine-grained_reduction dbr:KSP dbr:Path_protection dbr:Yen's_algorithm dbr:Segment_protection
is foaf:primaryTopic of	wikipedia-en:K_shortest_path_routing