Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9553-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1995714268
@@ Property / OpenAlex ID: W1995714268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Finding the detour-critical edge of a shortest path between two nodes
+Normal rank
@@ Property / cites work @@
+Q5417614
@@ Property / cites work: Q5417614 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank
@@ Property / cites work @@
+Finding an anti-risk path between two nodes in undirected graphs
+Normal rank