default search action

combined dblp search
author search
venue search
publication search

ask others

"Faster replacement paths algorithms in case of edge or node failure for ..."

Jay Mahadeokar, Sanjeev Saxena (2013)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2013.08.001

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/MahadeokarS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/MahadeokarS13
Jay Mahadeokar, Sanjeev Saxena:
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs. J. Discrete Algorithms 23: 54-62 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.