Graph Embedding through Random Walk for Shortest Paths Problems (Q3646123): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-04944-6_11
+Normal rank
@@ Property / OpenAlex ID @@
+W2114496166
@@ Property / OpenAlex ID: W2114496166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230366
@@ Property / cites work: Q4230366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4436057
@@ Property / cites work: Q4436057 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing almost shortest paths
@@ Property / cites work: Computing almost shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Universal augmentation schemes for network navigability
+Normal rank
@@ Property / cites work @@
+The small-world phenomenon
@@ Property / cites work: The small-world phenomenon / rank @@
+Normal rank
@@ Property / cites work @@
+Q5611441
@@ Property / cites work: Q5611441 / rank @@
+Normal rank
@@ Property / cites work @@
+Analyzing Kleinberg's (and other) small-world Models
+Normal rank
@@ Property / cites work @@
+A critical point for random graphs with a given degree sequence
+Normal rank
@@ Property / cites work @@
+Q5580725
@@ Property / cites work: Q5580725 / rank @@
+Normal rank
@@ Property / cites work @@
+Distance in random graphs with infinite mean degrees
+Normal rank