scientific article; zbMATH DE number 432842
From MaRDI portal
Publication:3138976
Cited in
(7)- A faster parallel algorithm for a matrix searching problem
- Finding a closet visible vertex pair between two polygons
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
- Parallel methods for visibility and shortest-path problems in simple polygons
- On parallel rectilinear obstacle-avoiding paths
- A faster parallel algorithm for a matrix searching problem
- Computing the all-pairs longest chains in the plane
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138976)