Trans-dichotomous algorithms for minimum spanning trees and shortest paths (Q1329156): Difference between revisions

@@ Property / Wikidata QID @@
+Q55951522
@@ Property / Wikidata QID: Q55951522 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for the shortest path problem
@@ Property / cites work: Faster algorithms for the shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Hash functions for priority queues
@@ Property / cites work: Hash functions for priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+Linear verification for spanning trees
@@ Property / cites work: Linear verification for spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(05)80064-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2164485560
@@ Property / OpenAlex ID: W2164485560 / rank @@
+Normal rank