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

Latest revision as of 21:46, 29 July 2024

scientific article; zbMATH DE number 7573209

Language	Label	Description	Also known as
English	Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems	scientific article; zbMATH DE number 7573209

Statements

instance of

scholarly article

0 references

title

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

0 references

author

Dimitris J. Kavvadias

0 references

Grammati E. Pantziou

0 references

Paul G. Spirakis

0 references

Christos D. Zaroliagis

0 references

published in

Mathematical Foundations of Computer Science 1994

0 references

publication date

18 August 2022

0 references

full work available at URL

http://hdl.handle.net/11858/00-001M-0000-0014-B521-0

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Parallel computational geometry

0 references

Q3140396

0 references

Matrix multiplication via arithmetic progressions

0 references

Q4036575

0 references

Planar graph decomposition and all pairs shortest paths

0 references

Designing networks with compact routing tables

0 references

Fibonacci heaps and their uses in improved network optimization algorithms

0 references

Q3757929

0 references

Q4023519

0 references

Q4385522

0 references

Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems

0 references

Q4525710

0 references

Parallel ear decomposition search (EDS) and st-numbering in graphs

0 references

Priority Search Trees

0 references

Efficient parallel algorithms for shortest paths in planar digraphs

0 references

An O(logn) parallel connectivity algorithm

0 references

Q3707420

0 references

The graph genus problem is NP-complete

0 references

Q3711761

0 references

Identifiers

zbMATH Open document ID

1493.68272

0 references

DOI

10.1007/3-540-58338-6_93

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5096905

@@ Property / OpenAlex ID @@
+W4249165371
@@ Property / OpenAlex ID: W4249165371 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel computational geometry
@@ Property / cites work: Parallel computational geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140396
@@ Property / cites work: Q3140396 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036575
@@ Property / cites work: Q4036575 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graph decomposition and all pairs shortest paths
+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 @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / 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 @@
+Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
+Normal rank
@@ Property / cites work @@
+Q4525710
@@ Property / cites work: Q4525710 / 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 @@
+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 @@
+Q3707420
@@ Property / cites work: Q3707420 / 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