Pages that link to "Item:Q1603442"
From MaRDI portal
The following pages link to A faster computation of the most vital edge of a shortest path (Q1603442):
Displaying 27 items.
- Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
- Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
- A simple algorithm for replacement paths problem (Q327668) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
- Finding an anti-risk path between two nodes in undirected graphs (Q732313) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Finding the anti-block vital edge of a shortest path between two nodes (Q1016036) (← links)
- Finding the most vital node of a shortest path. (Q1401266) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- Optimal shortest path set problem in undirected graphs (Q2343975) (← links)
- Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
- The swap edges of a multiple-sources routing tree (Q2479532) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes (Q3611946) (← links)
- (Q4551366) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- Conditional hardness for sensitivity problems (Q4638076) (← links)
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners (Q5090997) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- Stochastic Algorithms: Foundations and Applications (Q5901983) (← links)
