A simpler and more efficient algorithm for the next-to-shortest path problem (Q1939658): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3098776817
@@ Property / OpenAlex ID: W3098776817 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0608
@@ Property / arXiv ID: 1105.0608 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominators in Linear Time
@@ Property / cites work: Dominators in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3639634
@@ Property / cites work: Q3639634 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding next-to-shortest paths in a graph
@@ Property / cites work: Finding next-to-shortest paths in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Computing strictly-second shortest paths
@@ Property / cites work: Computing strictly-second shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithm for finding next-to-shortest paths
+Normal rank
@@ Property / cites work @@
+A quadratic algorithm for finding next-to-shortest paths in graphs
+Normal rank
@@ Property / cites work @@
+Undirected single-source shortest paths with positive integer weights in linear time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1939658