Finding a contra-risk path between two nodes in undirected graphs
From MaRDI portal
Publication:326494
DOI10.1007/S10878-015-9912-8zbMATH Open1354.90152OpenAlexW755651516MaRDI QIDQ326494FDOQ326494
Authors: Mehdi Ghiyasvand, Iman Keshtkar 
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9912-8
Recommendations
- Finding an anti-risk path between two nodes in undirected graphs
- Faster algorithm to find anti-risk path between two nodes of an undirected graph
- Finding paths in graphs avoiding forbidden transitions
- Finding next-to-shortest paths in a graph
- An algorithm to find all paths between two nodes in a graph
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
- On the Minimum Risk-Sum Path Problem
- Finding the detour-critical edge of a shortest path between two nodes
- The risk path selection problem in uncertain network
- Finding the shortest paths by node combination
Cites Work
- Network flows. Theory, algorithms, and applications.
- The k most vital arcs in the shortest path problem
- Finding the detour-critical edge of a shortest path between two nodes
- A faster computation of the most vital edge of a shortest path
- Faster algorithm to find anti-risk path between two nodes of an undirected graph
- Optimal shortest path set problem in undirected graphs
- Algorithmic mechanism design (extended abstract)
- Title not available (Why is that?)
- Finding an anti-risk path between two nodes in undirected graphs
Cited In (3)
This page was built for publication: Finding a contra-risk path between two nodes in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326494)
