OurBigBook About$ Donate
 Sign in Sign up

Contraction hierarchies

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Graph algorithms
 0 By others on same topic  0 Discussions Create my own version
Contraction hierarchies is an algorithmic technique used in graph theory and network routing, particularly for speeding up shortest path queries on large and complex networks such as road networks. It was introduced to improve the efficiency of finding shortest paths while reducing the time complexity from that of traditional algorithms like Dijkstra's or Bellman-Ford.

 Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook