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

Jay Mahadeokar, Sanjeev Saxena (2014)

> Home

Details and statistics

DOI: 10.1007/S10878-012-9553-0

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/MahadeokarS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/MahadeokarS14
Jay Mahadeokar, Sanjeev Saxena:
Faster algorithm to find anti-risk path between two nodes of an undirected graph. J. Comb. Optim. 27(4): 798-807 (2014)

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.