IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-24971-1_7.html
   My bibliography  Save this book chapter

Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies

In: Gems of Combinatorial Optimization and Graph Algorithms

Author

Listed:
  • Ben Strasser

    (Karlsruher Institut für Technologie, Institut für Theoretische Informatik)

  • Dorothea Wagner

    (Karlsruher Institut für Technologie, Institut für Theoretische Informatik)

Abstract

Graph fill-in, elimination ordering, separators, nested dissection orders and tree-width are only some examples of classical graph concepts that are related in manifold ways. This essay shows how contraction hierarchies, a successful approach to speed up Dijkstra’s algorithm for shortest paths, fits into this series of graph concepts. A theoretical consequence of this insight is a guarantee for the size of the search space required by Dijkstra’s algorithm combined with contraction hierarchies. On the other hand, the use of nested dissection leads to a very practicable variant of contraction hierarchies that can be applied in scenarios where edge lengths often change.

Suggested Citation

  • Ben Strasser & Dorothea Wagner, 2015. "Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies," Springer Books, in: Andreas S. Schulz & Martin Skutella & Sebastian Stiller & Dorothea Wagner (ed.), Gems of Combinatorial Optimization and Graph Algorithms, pages 69-82, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-24971-1_7
    DOI: 10.1007/978-3-319-24971-1_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-24971-1_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.