IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v27y2014i4d10.1007_s10878-012-9553-0.html
   My bibliography  Save this article

Faster algorithm to find anti-risk path between two nodes of an undirected graph

Author

Listed:
  • Jay Mahadeokar

    (Indian Institute of Technology)

  • Sanjeev Saxena

    (Indian Institute of Technology)

Abstract

For a weighted 2-edge connected graph G=(V,E), we are to find a “minimum risk path” from source s to destination t. This is a shortest s−t path under the assumption that at most one edge on the path may be blocked. The fact that the edge is blocked is known only when we reach a site adjacent to the blocked edge. If n and m are the number of nodes and edges of G, then we show that this problem can be solved in O(n 2) time using only simple data structures. This is an improvement over the previous O(mn+n 2logn) time algorithm. Moreover, with use of more complicated data structures like Fibonacci Heaps and transmuters the time can be further reduced to O(m+nlogn).

Suggested Citation

  • Jay Mahadeokar & Sanjeev Saxena, 2014. "Faster algorithm to find anti-risk path between two nodes of an undirected graph," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 798-807, May.
    • Handle: RePEc:spr:jcomop:v:27:y:2014:i:4:d:10.1007_s10878-012-9553-0
    DOI: 10.1007/s10878-012-9553-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9553-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9553-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peng Xiao & Yinfeng Xu & Bing Su, 2009. "Finding an anti-risk path between two nodes in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 17(3), pages 235-246, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mehdi Ghiyasvand & Iman Keshtkar, 2016. "Finding a contra-risk path between two nodes in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 917-926, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    2. Mehdi Ghiyasvand & Iman Keshtkar, 2016. "Finding a contra-risk path between two nodes in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 917-926, October.

    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:jcomop:v:27:y:2014:i:4:d:10.1007_s10878-012-9553-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.