scientific article; zbMATH DE number 910885
From MaRDI portal
zbMATH Open0849.68092MaRDI QIDQ4886059FDOQ4886059
Authors: Danny Z. Chen 
Publication date: 4 November 1996
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)
Cited In (14)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Routing among convex polygonal obstacles in the plane
- Approximate Euclidean shortest paths amid convex obstacles
- All pairs lightest shortest paths
- Rectilinear short path queries among rectangular obstacles
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
- All pairs shortest paths for graphs with small integer length edges
- Approximate distance oracles for graphs with dense clusters
- On the Euclidean two paths problem
- Routing among convex polygonal obstacles in the plane
- On bounded leg shortest paths problems
- Fast optimal and bounded suboptimal Euclidean pathfinding
- On bounded leg shortest paths problems
- Querying two boundary points for shortest paths in a polygonal domain
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 Q4886059)
