Pages that link to "Item:Q1322567"
From MaRDI portal
The following pages link to A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567):
Displaying 12 items.
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- A new algorithm for the minimum spanning tree verification problem (Q2340495) (← links)
- Optimal parallel verification of minimum spanning trees in logarithmic time (Q2365173) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
- Finding the k smallest spanning trees (Q5056090) (← links)
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
