Skip to main content
SpringerLink
Log in

Memory Efficient Shortest Path Algorithms for Cactus Graphs

  • Conference paper
Advances in Visual Computing (ISVC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 8033))

Included in the following conference series:

  • 2760 Accesses

Abstract

The shortest path problem is fundamental to many areas of image processing, and we present ways to solve it in environments where computation space is scarce. We propose two constant-work-space algorithms for solving the shortest path problem for cactus graphs and clique-cactus graphs of arbitrary size; both algorithms perform in polynomial time. We also present an in-place algorithm for finding the shortest path in cactus graphs, which performs in polynomial time of lower degree.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asano, T.: Constant-working-space algorithms: How fast can we solve problems without using any extra array? In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, p. 1. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Asano, T.: Constant-working-space algorithm for image processing. In: Proc. of the First AAAC Annual meeting, Hong Kong, p. 3 (2008)

    Google Scholar 

  3. Asano, T.: Constant-working-space algorithms for image processing. In: Nielsen, F. (ed.) ETVC 2008. LNCS, vol. 5416, pp. 268–283. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Asano, T.: Constant-working-space image scan with a given angle. In: Proc. 24th European Workshop Comput. Geom (EWCG), Nancy, pp. 165–168 (2009)

    Google Scholar 

  5. Asano, T., Mulzer, W., Wang, Y.: Constant work-space algorithms for shortest paths in trees and simple polygons. J. of Graph Algorithms and Applications 15(5), 569–586 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide and conquer algorithms. Comput. Geom. Theory Appl. 37(3), 209–227 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bronnimann, H., Chan, T.M.: Space-Efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34(2), 75–82 (2006)

    Article  MathSciNet  Google Scholar 

  8. Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: Proc. 20th Annual ACM Symposium on Computational Geometry, pp. 239–246 (2004)

    Google Scholar 

  9. Farhan, H.A., Owaied, H.H., Al-Ghazi Finding, S.I.: Shortest path for developed cognitive map using medial axis. World of Computer Science and Information Technology Journal 1(2), 17–25 (2011)

    Google Scholar 

  10. Hubler, A., Klette, R., Werner, G.: Shortest path algorithms for graphs of restricted in-degree and out-degree. Elektronische Informationsverarbeitung Kybernetik 18, 141–151 (1982)

    MathSciNet  Google Scholar 

  11. Jakoby, A., Tantau, T.: Logspace algorithms for computing shortest and longest paths in series-parallel graphs. Technical Report TR03-077, ECCC Reports (2003)

    Google Scholar 

  12. Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoretical Computer Science 165(2), 311–323 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Muñuzuri, A.P., Chua, L.O.: Shortest-path-finder algorithm in a two-dimensional array of nonlinear electronic circuits. International Journal of Bifurcation and Chaos 8(12), 2493–2501 (1998)

    Article  MATH  Google Scholar 

  14. Murata, Y., Mitani, Y.: A study of shortest path algorithms in maze images. In: Proc. SICE Annual Conference (SICE), pp. 32–33 (2011)

    Google Scholar 

  15. Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), Art. #17, 24 pages (2008)

    Google Scholar 

  16. Sheng, Y.B., Wei, Y.K., Ping, L.J.: Research and application of image segmentation algorithm based on the shortest path in medical tongue processing. In: Proc. of the 2009 WRI World Congress on Software Engineering, vol. 1, pp. 239–243 (2009)

    Google Scholar 

  17. Yan, P., Kassim, A.A.: Medical image segmentation using minimal path deformable models with implicit shape priors. IEEE Transactions on Information Technology in Biomedicine 10(4), 677–684 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computational & Applied Mathematics, Rice University, 6100 Main St. - MS 134, Houston, TX, 77005-1892, USA

    Boris Brimkov

Authors
  1. Boris Brimkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Nevada, Reno, NV, USA

    George Bebis

  2. NASA Ames Research Center, Moffett Field, CA, USA

    Richard Boyle

  3. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Bahram Parvin

  4. Desert Research Institute, Reno, NV, USA

    Darko Koracin

  5. Arizona State University, Tempe, AZ, USA

    Baoxin Li

  6. Mitsubishi Electric Research Laboratories, Cambridge, MA, USA

    Fatih Porikli

  7. University of California, Riverside, CA, USA

    Victor Zordan

  8. AT&T Research Labs, Florham Park, NJ, USA

    James Klosowski

  9. ZIRST, Saint-Ismier Cedex, France

    Sabine Coquillart

  10. Qualcomm Research, San Diego, CA, USA

    Xun Luo

  11. Oxford e-Research Centre, University of Oxford, Oxford, UK

    Min Chen

  12. IBM, Hawthorne, NY, USA

    David Gotz

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brimkov, B. (2013). Memory Efficient Shortest Path Algorithms for Cactus Graphs. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2013. Lecture Notes in Computer Science, vol 8033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41914-0_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41913-3

  • Online ISBN: 978-3-642-41914-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation