Discovery of network properties with all-shortest-paths queries (Q962167): Difference between revisions

@@ Property / author @@
-Erlebach, Thomas
@@ Property / author: Erlebach, Thomas / rank @@
-Normal rank
@@ Property / author @@
+Erlebach, Thomas
@@ Property / author: Erlebach, Thomas / 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.1016/j.tcs.2010.01.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2050803155
@@ Property / OpenAlex ID: W2050803155 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On recognizing graph properties from adjacency matrices
+Normal rank
@@ Property / cites work @@
+Q4788610
@@ Property / cites work: Q4788610 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4464781
@@ Property / cites work: Q4464781 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank