Skip to main content
Erschienen in: Artificial Intelligence Review 3/2020

18.05.2019

Generation of maximal fuzzy cliques of fuzzy permutation graph and applications

verfasst von: Sreenanda Raut, Madhumangal Pal

Erschienen in: Artificial Intelligence Review | Ausgabe 3/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Fuzzy permutation graph (FPG) plays a significant role in solving real-life problems where the scope and application of crisp permutation graph get limited due to the fuzziness involved in real situations. In this article an algorithm is designed to find out all maximal fuzzy cliques of a FPG. A similar algorithm is developed at the same time to find out all maximal fuzzy independent sets of the said graph. The inter-relationship between FPG and its two types of complements is presented based on the facts and theories established on fuzzy cliques and fuzzy independent sets. The importance of fuzzy cliques of FPG is discussed through an application on a daily-life problem. The unique property of a FPG having two types of complement graphs help us to solve many useful problems. Here, we have shown how this property of FPG helps us to overcome a hazardous situation occurred due to disrupted scheduling of trains on a foggy day.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Chang MS, Wang FH (1992) Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Inf Process Lett 43:293–295MathSciNetCrossRef Chang MS, Wang FH (1992) Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Inf Process Lett 43:293–295MathSciNetCrossRef
Zurück zum Zitat Chartrand G, Harary F (1967) Planar permutation graphs. Ann Inst H. Poincaré Sect B (NS) 3:433–438MathSciNetMATH Chartrand G, Harary F (1967) Planar permutation graphs. Ann Inst H. Poincaré Sect B (NS) 3:433–438MathSciNetMATH
Zurück zum Zitat Craine WL (1993) Fuzzy hypergraphs and fuzzy intersection graphs. Doctoral thesis, Air Force Institute of Technology, Wright-Patterson Craine WL (1993) Fuzzy hypergraphs and fuzzy intersection graphs. Doctoral thesis, Air Force Institute of Technology, Wright-Patterson
Zurück zum Zitat Golumbic MC (1980) Algorithmic graph theory and perfect graphs. Academic, New YorkMATH Golumbic MC (1980) Algorithmic graph theory and perfect graphs. Academic, New YorkMATH
Zurück zum Zitat Klein PN (1988) Efficient parallel algorithms for chordal graphs. In: Proceeding of the 29th IEEE FOCS, pp 150–161 Klein PN (1988) Efficient parallel algorithms for chordal graphs. In: Proceeding of the 29th IEEE FOCS, pp 150–161
Zurück zum Zitat Leung JYT (1984) Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs. J Algorithms 5:22–35MathSciNetCrossRef Leung JYT (1984) Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs. J Algorithms 5:22–35MathSciNetCrossRef
Zurück zum Zitat Mordeson JN, Nair PS (2000) Fuzzy graphs and fuzzy hypergraphs. Springer, BerlinCrossRef Mordeson JN, Nair PS (2000) Fuzzy graphs and fuzzy hypergraphs. Springer, BerlinCrossRef
Zurück zum Zitat Nair PS, Cheng SC (2001) Cliques and fuzzy cliques in fuzzy graphs. In: Joint 9th IFSA world congress and 20th NAFIPS international conference, Vancouver, pp 2277–2280 Nair PS, Cheng SC (2001) Cliques and fuzzy cliques in fuzzy graphs. In: Joint 9th IFSA world congress and 20th NAFIPS international conference, Vancouver, pp 2277–2280
Zurück zum Zitat Pal M (1996) An efficient parallel algorithm for computing a maximum-weight independent set on permutation graphs. In: Proceeding of the 6th national seminar on theoretical computer science, Rajasthan, August, pp 276–285 Pal M (1996) An efficient parallel algorithm for computing a maximum-weight independent set on permutation graphs. In: Proceeding of the 6th national seminar on theoretical computer science, Rajasthan, August, pp 276–285
Zurück zum Zitat Pal M (1998) A parallel algorithm to generate all maximal independent sets on permutation graphs. Int J Comput Math 67(3–4):261–274MathSciNetCrossRef Pal M (1998) A parallel algorithm to generate all maximal independent sets on permutation graphs. Int J Comput Math 67(3–4):261–274MathSciNetCrossRef
Zurück zum Zitat Pal M (2013) Intersection graphs: an introduction. Ann Pure Appl Math 4(1):43–91 Pal M (2013) Intersection graphs: an introduction. Ann Pure Appl Math 4(1):43–91
Zurück zum Zitat Pal M, Bhattacharjee GP (1995) An optimal parallel algorithm for computing all maximal cliques of an interval graph and its applications. J Inst Eng (India) 76:29–33 Pal M, Bhattacharjee GP (1995) An optimal parallel algorithm for computing all maximal cliques of an interval graph and its applications. J Inst Eng (India) 76:29–33
Zurück zum Zitat Pnueli A, Lempel A, Even S (1971) Transitive orientation of graphs and identification of permutation graphs. Can J Math 23:160–175MathSciNetCrossRef Pnueli A, Lempel A, Even S (1971) Transitive orientation of graphs and identification of permutation graphs. Can J Math 23:160–175MathSciNetCrossRef
Zurück zum Zitat Raut S, Pal M, Ghorai G (2018) Fuzzy permutation graph and its applications. J Intell Fuzzy Syst 35:2199–2213CrossRef Raut S, Pal M, Ghorai G (2018) Fuzzy permutation graph and its applications. J Intell Fuzzy Syst 35:2199–2213CrossRef
Zurück zum Zitat Rosenfeld A (1975) In: Zadeh LA, Fu KS, Shimura M (eds) Fuzzy graphs. Fuzzy sets and their application. Academic, New York, pp 77–95 Rosenfeld A (1975) In: Zadeh LA, Fu KS, Shimura M (eds) Fuzzy graphs. Fuzzy sets and their application. Academic, New York, pp 77–95
Zurück zum Zitat Sun F, Wang X, Qu X (2016) Cliques and clique covers in fuzzy graphs. J Intell Fuzzy Syst 31:1245–1256CrossRef Sun F, Wang X, Qu X (2016) Cliques and clique covers in fuzzy graphs. J Intell Fuzzy Syst 31:1245–1256CrossRef
Zurück zum Zitat Sunitha MS, Kumar AV (2002) Complemnets of fuzzy graphs. Indian J Pure Appl Math 33:1451–1464MathSciNetMATH Sunitha MS, Kumar AV (2002) Complemnets of fuzzy graphs. Indian J Pure Appl Math 33:1451–1464MathSciNetMATH
Zurück zum Zitat Yu CW, Chen GH (1993) Generate all maximal independent sets in permutation graphs. Int J Comput Math 47:1–8CrossRef Yu CW, Chen GH (1993) Generate all maximal independent sets in permutation graphs. Int J Comput Math 47:1–8CrossRef
Metadaten
Titel
Generation of maximal fuzzy cliques of fuzzy permutation graph and applications
verfasst von
Sreenanda Raut
Madhumangal Pal
Publikationsdatum
18.05.2019
Verlag
Springer Netherlands
Erschienen in
Artificial Intelligence Review / Ausgabe 3/2020
Print ISSN: 0269-2821
Elektronische ISSN: 1573-7462
DOI
https://doi.org/10.1007/s10462-019-09714-7

Weitere Artikel der Ausgabe 3/2020

Artificial Intelligence Review 3/2020 Zur Ausgabe