Skip to main content

Part of the book series: Advances in Soft Computing ((AINSC,volume 42))

Abstract

The task of finding shortest paths in graphs has been studied intensively over the past five decades. Shortest paths are one of the simplest and most widely used concepts in networks. More recently, fuzzy graphs, along with generalizations of algorithms for finding optimal paths within them, have emerged as an adequate modeling tool for imprecise systems. Fuzzy shortest paths also have a variety of applications. In this paper, the authors present a model based on dynamic programming to find the shortest paths in intuitionistic fuzzy graphs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Adamo, J.H.: Fuzzy decision trees. Fuzzy Sets and Systems 4, 207–219 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Atanassov, K.: Index matrix representation of intuitionistic fuzzy graphs. In: Fifth Scientific session of the Mathematical Foundations of Artificial Intelligence Seminar, Sofia, Oct. 5 1994, pp. 36–41 (1994)

    Google Scholar 

  3. Atanassov, K., Shannon, A.: On a generalization of intuitionistic fuzzy graphs. Notes on Intuitionistic Fuzzy Sets 8, 73–78 (2002)

    MATH  Google Scholar 

  4. Atanassov, K.: Intuitionistic fuzzy Sets. Notes on Intuitionistic Fuzzy Sets 4, 59–61 (1998)

    Google Scholar 

  5. Atanassov, K.: Intuitionistic fuzzy Sets. Springer, Berlin (1999)

    MATH  Google Scholar 

  6. Bondy, J.A., Murty, U.S.: Graph Theory with Appliations. Elsevier, New York (1997)

    Google Scholar 

  7. Dubois, D., Prade, H.: Fuzzy Sets and Systems. Academic Press, New York (1980)

    MATH  Google Scholar 

  8. Klein, C.M.: Fuzzy Shortest Paths. Fuzzy Sets and Systems 39, 27–41 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Oscar Castillo Patricia Melin Oscar Montiel Ross Roberto Sepúlveda Cruz Witold Pedrycz Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Karunambigai, M.G., Rangasamy, P., Atanassov, K., Palaniappan, N. (2007). An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks. In: Castillo, O., Melin, P., Ross, O.M., Sepúlveda Cruz, R., Pedrycz, W., Kacprzyk, J. (eds) Theoretical Advances and Applications of Fuzzy Logic and Soft Computing. Advances in Soft Computing, vol 42. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72434-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72434-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72433-9

  • Online ISBN: 978-3-540-72434-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics