Pages that link to "Item:Q1401266"

The following pages link to Finding the most vital node of a shortest path. (Q1401266):

Displaying 15 items.

• The impact of dynamic events on the number of errors in networks (Q265066) (← links)
• A simple algorithm for replacement paths problem (Q327668) (← links)
• Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
• Incremental distance products via faulty shortest paths (Q783710) (← links)
• Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
• Finding the anti-block vital edge of a shortest path between two nodes (Q1016036) (← links)
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs (Q1665401) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
• Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
• Faster swap edge computation in minimum diameter spanning trees (Q2428664) (← links)
• Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
• (Q5743393) (← links)
• Distributed constructions of dual-failure fault-tolerant distance preservers (Q6535019) (← links)