An algorithm for the determination of longest distances in a graph (Q4097107): Difference between revisions

@@ Property / author @@
-Hartmut Noltemeier
@@ Property / author: Hartmut Noltemeier / rank @@
-Normal rank
@@ Property / author @@
+Hartmut Noltemeier
@@ Property / author: Hartmut Noltemeier / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583695
@@ Property / cites work: Q5583695 / 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 @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4050139
@@ Property / cites work: Q4050139 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Dijkstra's Shortest Path Algorithm
@@ Property / cites work: A Note on Dijkstra's Shortest Path Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q5634006
@@ Property / cites work: Q5634006 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank