Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A simple parallel tree contraction algorithm
@@ Property / cites work: A simple parallel tree contraction algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel computational geometry
@@ Property / cites work: Parallel computational geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel shortest paths in small treewidth digraphs
+Normal rank
@@ Property / cites work @@
+Q3140396
@@ Property / cites work: Q3140396 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic coin tossing with applications to optimal parallel list ranking
+Normal rank
@@ Property / cites work @@
+Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3975142
@@ Property / cites work: Q3975142 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3717092
@@ Property / cites work: Q3717092 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036575
@@ Property / cites work: Q4036575 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line and dynamic algorithms for shortest path problems
+Normal rank
@@ Property / cites work @@
+Planar graph decomposition and all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Searching among intervals and compact routing tables
+Normal rank
@@ Property / cites work @@
+Designing networks with compact routing tables
@@ Property / cites work: Designing networks with compact routing tables / rank @@
+Normal rank
@@ Property / cites work @@
+A separator theorem for graphs of bounded genus
@@ Property / cites work: A separator theorem for graphs of bounded genus / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Symmetry-Breaking in Sparse Graphs
@@ Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms on planar graphs
@@ Property / cites work: Optimal parallel algorithms on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel ear decomposition search (EDS) and st-numbering in graphs
+Normal rank
@@ Property / cites work @@
+Priority Search Trees
@@ Property / cites work: Priority Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219753
@@ Property / cites work: Q3219753 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3670555
@@ Property / cites work: Q3670555 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for shortest paths in planar digraphs
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q3727386
@@ Property / cites work: Q3727386 / rank @@
+Normal rank
@@ Property / cites work @@
+The graph genus problem is NP-complete
@@ Property / cites work: The graph genus problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3711761
@@ Property / cites work: Q3711761 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(96)00065-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2009248757
@@ Property / OpenAlex ID: W2009248757 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1351004