Matches in DBpedia 2014 for { <http://dbpedia.org/resource/K_shortest_path_routing> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- K_shortest_path_routing abstract "The K shortest path routing algorithm is an extension algorithm of the shortest path routing algorithm in a given network.It is sometimes crucial to have more than one path between two nodes in a given network. In the event there are additional constraints, other paths different from the shortest path can be computed. To find the shortest path one can use shortest path algorithms such as Dijkstra’s algorithm or Bellman Ford algorithm and extend them to find more than one path. The K Shortest path routing algorithm is a generalization of the shortest path problem. The algorithm not only finds the shortest path, but also K other paths in order of increasing cost.K is the number of shortest paths to find.The problem can be restricted to have the K shortest path without loops (loopless K shortest path) or with loop.".
- K_shortest_path_routing wikiPageExternalLink showciting;jsessionid=113691273F14638C24AC0F1657DA966F?cid=14257806.
- K_shortest_path_routing wikiPageExternalLink y71-shortestpath.pdf.
- K_shortest_path_routing wikiPageExternalLink 3401.full.pdf?keytype=ref&ijkey=LBKAnjRh0mW0xP4.
- K_shortest_path_routing wikiPageExternalLink summary?doi=10.1.1.43.9728.
- K_shortest_path_routing wikiPageExternalLink k-shortest-paths.
- K_shortest_path_routing wikiPageExternalLink teixeira.pdf.
- K_shortest_path_routing wikiPageExternalLink BerclazFTF11.pdf.
- K_shortest_path_routing wikiPageExternalLink ksp.
- K_shortest_path_routing wikiPageExternalLink citation.cfm?id=75797.
- K_shortest_path_routing wikiPageExternalLink j.artint.2011.07.003.
- K_shortest_path_routing wikiPageExternalLink imelamin.
- K_shortest_path_routing wikiPageExternalLink On-the-K-best-mode-in-computer-chess-measuring-the-similarity-of-move-proposals.html.
- K_shortest_path_routing wikiPageExternalLink finding_the_k_shortest_paths.pdf.
- K_shortest_path_routing wikiPageExternalLink uid62.html.
- K_shortest_path_routing wikiPageExternalLink fssrlgis.html.
- K_shortest_path_routing wikiPageExternalLink p189-aggarwal.pdf.
- K_shortest_path_routing wikiPageExternalLink kpath.bib.
- K_shortest_path_routing wikiPageExternalLink 216545964_An_algorithm_for_generating_all_the_paths_between_two_vertices_in_a_digraph_and_its_application.
- K_shortest_path_routing wikiPageExternalLink 0142061590900109.
- K_shortest_path_routing wikiPageExternalLink more-2432.
- K_shortest_path_routing wikiPageExternalLink DYADEM2010.pdf.
- K_shortest_path_routing wikiPageExternalLink Ingo+Alth%C3%B6fer.
- K_shortest_path_routing wikiPageExternalLink p213-ahuja.pdf?OpenElement.
- K_shortest_path_routing wikiPageID "37804593".
- K_shortest_path_routing wikiPageRevisionID "596667309".
- K_shortest_path_routing hasPhotoCollection K_shortest_path_routing.
- K_shortest_path_routing subject Category:Computational_problems_in_graph_theory.
- K_shortest_path_routing subject Category:Graph_algorithms.
- K_shortest_path_routing subject Category:Network_theory.
- K_shortest_path_routing subject Category:Polynomial-time_problems.
- K_shortest_path_routing comment "The K shortest path routing algorithm is an extension algorithm of the shortest path routing algorithm in a given network.It is sometimes crucial to have more than one path between two nodes in a given network. In the event there are additional constraints, other paths different from the shortest path can be computed. To find the shortest path one can use shortest path algorithms such as Dijkstra’s algorithm or Bellman Ford algorithm and extend them to find more than one path.".
- K_shortest_path_routing label "K shortest path routing".
- K_shortest_path_routing sameAs m.0p7862h.
- K_shortest_path_routing sameAs Q6343044.
- K_shortest_path_routing sameAs Q6343044.
- K_shortest_path_routing wasDerivedFrom K_shortest_path_routing?oldid=596667309.
- K_shortest_path_routing isPrimaryTopicOf K_shortest_path_routing.