Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Contraction_hierarchies> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Contraction_hierarchies abstract "In applied mathematics, the method of contraction hierarchies is a technique to speed up shortest-path routing by first creating precomputed "contracted" versions of the connection graph. It can be regarded as a special case of "highway-node routing".Contraction hierarchies can be used to generate shortest-path routes much more efficiently than Dijkstra's algorithm or previous highway-node routing approaches, and is used in many advanced routing techniques. It is publicly available in open source software to calculate routes from one place to another.".
- Contraction_hierarchies thumbnail ContractionHierarchies1.png?width=300.
- Contraction_hierarchies wikiPageID "30208672".
- Contraction_hierarchies wikiPageLength "6833".
- Contraction_hierarchies wikiPageOutDegree "13".
- Contraction_hierarchies wikiPageRevisionID "662130041".
- Contraction_hierarchies wikiPageWikiLink Category:Graph_algorithms.
- Contraction_hierarchies wikiPageWikiLink Category:Routing_algorithms.
- Contraction_hierarchies wikiPageWikiLink Dijkstras_algorithm.
- Contraction_hierarchies wikiPageWikiLink Graph_(mathematics).
- Contraction_hierarchies wikiPageWikiLink Precomputation.
- Contraction_hierarchies wikiPageWikiLink Precomputed.
- Contraction_hierarchies wikiPageWikiLink Routing.
- Contraction_hierarchies wikiPageWikiLink Shortest-path_routing.
- Contraction_hierarchies wikiPageWikiLink Shortest_path_problem.
- Contraction_hierarchies wikiPageWikiLink File:ContractionHierarchies1.png.
- Contraction_hierarchies wikiPageWikiLink File:ContractionHierarchies2.png.
- Contraction_hierarchies wikiPageWikiLink File:ContractionHierarchies3.png.
- Contraction_hierarchies wikiPageWikiLink File:ContractionHierarchies4.png.
- Contraction_hierarchies wikiPageWikiLinkText "Contraction hierarchies".
- Contraction_hierarchies wikiPageWikiLinkText "contraction hierarchies".
- Contraction_hierarchies hasPhotoCollection Contraction_hierarchies.
- Contraction_hierarchies wikiPageUsesTemplate Template:Reflist.
- Contraction_hierarchies subject Category:Graph_algorithms.
- Contraction_hierarchies subject Category:Routing_algorithms.
- Contraction_hierarchies hypernym Technique.
- Contraction_hierarchies type Software.
- Contraction_hierarchies type Algorithm.
- Contraction_hierarchies type Protocol.
- Contraction_hierarchies comment "In applied mathematics, the method of contraction hierarchies is a technique to speed up shortest-path routing by first creating precomputed "contracted" versions of the connection graph. It can be regarded as a special case of "highway-node routing".Contraction hierarchies can be used to generate shortest-path routes much more efficiently than Dijkstra's algorithm or previous highway-node routing approaches, and is used in many advanced routing techniques.".
- Contraction_hierarchies label "Contraction hierarchies".
- Contraction_hierarchies sameAs m.0g55990.
- Contraction_hierarchies sameAs Q5165688.
- Contraction_hierarchies sameAs Q5165688.
- Contraction_hierarchies wasDerivedFrom Contraction_hierarchies?oldid=662130041.
- Contraction_hierarchies depiction ContractionHierarchies1.png.
- Contraction_hierarchies isPrimaryTopicOf Contraction_hierarchies.