Finding an anti-risk path between two nodes in undirected graphs (Q732313): Difference between revisions

@@ Property / author @@
-Yin-Feng Xu
@@ Property / author: Yin-Feng Xu / rank @@
-Normal rank
@@ Property / author @@
+Yin-Feng Xu
@@ Property / author: Yin-Feng Xu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-007-9110-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2056436175
@@ Property / OpenAlex ID: W2056436175 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the most vital arcs in a network
@@ Property / cites work: Finding the most vital arcs in a network / rank @@
+Normal rank
@@ Property / cites work @@
+Most vital links and nodes in weighted networks
@@ Property / cites work: Most vital links and nodes in weighted networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418662
@@ Property / cites work: Q4418662 / rank @@
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+Normal rank
@@ Property / cites work @@
+Finding the detour-critical edge of a shortest path between two nodes
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:732313