-Algorithms for Minimum Link Path and Related Problems

DOI10.1006/JAGM.1995.1033zbMATH Open0839.68040OpenAlexW2078370308MaRDI QIDQ4845848FDOQ4845848

Authors: Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja 

Publication date: 28 May 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1033

Recommendations

• Parallel algorithms for all minimum link paths and link center problems
• Optimal parallel algorithms for rectilinear link-distance problems
• scientific article; zbMATH DE number 1256695
• Parallel algorithms for shortest path problems in polygons
• scientific article; zbMATH DE number 1424300

zbMATH Keywords

minimum link path problemminimum nested polygon problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cited In (6)

• Fast RNC and NC algorithms for maximal path sets
• Optimal parallel algorithms for rectilinear link-distance problems
• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• An optimal algorithm for computing a minimum nested nonconvex polygon
• NC algorithms for finding a maximal set of paths with application to compressing strings
• Parallel algorithms for all minimum link paths and link center problems

This page was built for publication: -Algorithms for Minimum Link Path and Related Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845848)