Relevant bibliographies by topics / Fuzzy graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Fuzzy graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fuzzy graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fuzzy graphs"

1

Havare, Özge Çolakoğlu. "On Thorny Fuzzy Graphs." International Journal of Fuzzy Mathematical Archive 13, no. 02 (2017): 213–17. http://dx.doi.org/10.22457/ijfma.v13n2a11.

Full text
Abstract:
A thorny fuzzy graph which is analogous to the concept thorny graphs in crisp graph theory is defined. The degree of an edge in thorny fuzzy graphs is obtained. Also, the degree of an edge in fuzzy graph formed by this operation in terms of the degree of edges in the given fuzzy graphs in some particular cases is found. Moreover, it is proved that thorny fuzzy graph of effective fuzzy graph is effective.
APA, Harvard, Vancouver, ISO, and other styles
2

Ramesh, Obbu, and S. Sharief Basha. "An Intuitionistic Fuzzy Graph’s Signless Laplacian Energy." International Journal of Engineering & Technology 7, no. 4.10 (October 2, 2018): 892. http://dx.doi.org/10.14419/ijet.v7i4.10.26782.

Full text
Abstract:
We are extending concept into the Intuitionistic fuzzy graph’ Signless Laplacian energy instead of the Signless Laplacian energy of fuzzy graph. Now we demarcated an Intuitionistic fuzzy graph’s Signless adjacency matrix and also an Intuitionistic fuzzy graph’s Signless Laplacian energy. Here we find the Signless Laplacian energy ‘s Intuitionistic fuzzy graphs above and below boundaries of an with suitable examples.
APA, Harvard, Vancouver, ISO, and other styles
3

Abebe Ashebo, Mamo, and V. N. Srinivasa Rao Repalle. "Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts." Advances in Fuzzy Systems 2019 (May 2, 2019): 1–11. http://dx.doi.org/10.1155/2019/5213020.

Full text
Abstract:
Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc. In this paper, the concept of fuzzy chromatic polynomial of fuzzy graph is introduced and defined based on α-cuts of fuzzy graph. Two different types of fuzziness to fuzzy graph are considered in the paper. The first type was fuzzy graph with crisp vertex set and fuzzy edge set and the second type was fuzzy graph with fuzzy vertex set and fuzzy edge set. Depending on this, the fuzzy chromatic polynomials for some fuzzy graphs are discussed. Some interesting remarks on fuzzy chromatic polynomial of fuzzy graphs have been derived. Further, some results related to the concept are proved. Lastly, fuzzy chromatic polynomials for complete fuzzy graphs and fuzzy cycles are studied and some results are obtained.
APA, Harvard, Vancouver, ISO, and other styles
4

Chaitanya, Ch, and T. V. Pradeep Kumar. "ON THE COMPLETE PRODUCT OF FUZZY GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 18, no. 02 (September 24, 2022): 185–96. http://dx.doi.org/10.56827/seajmms.2022.1802.17.

Full text
Abstract:
Strong fuzzy graph and complete fuzzy graph are two special kinds of fuzzy graphs in which each edge membership value equals the least of its vertex membership values incidental to the edge. In this research study, we obtain some interesting results on the complete product of a pair of strong fuzzy graphs as well as the complete product of a pair of complete fuzzy graphs. In precise, we prove that the complete product of two strong fuzzy graphs is again a strong fuzzy graph and the complete product of two complete fuzzy graphs is again a complete fuzzy graph. Also, we discuss the conditions under which the property of regularity will be mutually transmitted between the complete product of two fuzzy graphs and one of its factor fuzzy graphs
APA, Harvard, Vancouver, ISO, and other styles
5

Akram, Muhammad, and Neha Waseem. "Certain Metrics in m-Polar Fuzzy Graphs." New Mathematics and Natural Computation 12, no. 02 (June 8, 2016): 135–55. http://dx.doi.org/10.1142/s1793005716500101.

Full text
Abstract:
In this paper, we present certain metrics in m-polar fuzzy graphs including antipodal m-polar fuzzy graphs and self median m-polar fuzzy graph of given m-polar fuzzy graphs. We illustrate the concepts of metric in m-polar fuzzy graphs by several examples and investigate some of their properties. We discuss some properties of isomorphic m-polar fuzzy graphs. We also describe an application of m-polar fuzzy graph in a road network.
APA, Harvard, Vancouver, ISO, and other styles
6

Havare, Özge Çolakoğlu, and Hamza Menken. "On Corona Product of Two Fuzzy Graphs." International Journal of Fuzzy Mathematical Archive 11, no. 02 (2016): 95–100. http://dx.doi.org/10.22457/ijfma.v11n2a5.

Full text
Abstract:
Corona product of two fuzzy graphs which is analogous to the concept corona product operation in crisp graph theory is defined. The degree of an edge in corona product of fuzzy graphs is obtained. Also, the degree of an edge in fuzzy graph formed by this operation in terms of the degree of edges in the given fuzzy graphs in some particular cases is found. Moreover, it is proved that corona product of two fuzzy graphs is effective when two fuzzy graphs is effective fuzzy graphs.
APA, Harvard, Vancouver, ISO, and other styles
7

Repalle, V. N. Srinivasa Rao, and Fekadu Tesgera Agama. "2-Quasitotal Fuzzy Graphs and Their Total Coloring." Advances in Fuzzy Systems 2020 (November 20, 2020): 1–10. http://dx.doi.org/10.1155/2020/8814220.

Full text
Abstract:
Coloring of fuzzy graphs has many real-life applications in combinatorial optimization problems like traffic light system, exam scheduling, and register allocation. The coloring of total fuzzy graphs and its applications are well studied. This manuscript discusses the description of 2-quasitotal graph for fuzzy graphs. The proposed concept of 2-quasitotal fuzzy graph is explicated by several numerical examples. Moreover, some theorems related to the properties of 2-quasitotal fuzzy graphs are stated and proved. The results of these theorems are compared with the results obtained from total fuzzy graphs and 1-quasitotal fuzzy graphs. Furthermore, it defines 2-quasitotal coloring of fuzzy total graphs and which is justified.
APA, Harvard, Vancouver, ISO, and other styles
8

Alshehri, Noura, and Muhammad Akram. "Intuitionistic Fuzzy Planar Graphs." Discrete Dynamics in Nature and Society 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/397823.

Full text
Abstract:
Graph theory has numerous applications in modern sciences and technology. Atanassov introduced the concept of intuitionistic fuzzy sets as a generalization of fuzzy sets. Intuitionistic fuzzy set has shown advantages in handling vagueness and uncertainty compared to fuzzy set. In this paper, we apply the concept of intuitionistic fuzzy sets to multigraphs, planar graphs, and dual graphs. We introduce the notions of intuitionistic fuzzy multigraphs, intuitionistic fuzzy planar graphs, and intuitionistic fuzzy dual graphs and investigate some of their interesting properties. We also study isomorphism between intuitionistic fuzzy planar graphs.
APA, Harvard, Vancouver, ISO, and other styles
9

Mordeson, John N., and Sunil Mathew. "Fuzzy End Nodes in Fuzzy Incidence Graphs." New Mathematics and Natural Computation 13, no. 01 (January 31, 2017): 13–20. http://dx.doi.org/10.1142/s1793005717500028.

Full text
Abstract:
The notion of a fuzzy end node in fuzzy incidence graphs is developed in this article. The concept of a fuzzy incidence graph is new and should be very useful in applications in fuzzy graphs and fuzzy networks. Relationships between weak incidence pairs and fuzzy incidence end nodes and fuzzy incidence cut vertices are developed.
APA, Harvard, Vancouver, ISO, and other styles
10

Broumi, Said, Florentin Smarandache, Mohamed Talea, and Assia Bakali. "An Introduction to Bipolar Single Valued Neutrosophic Graph Theory." Applied Mechanics and Materials 841 (June 2016): 184–91. http://dx.doi.org/10.4028/www.scientific.net/amm.841.184.

Full text
Abstract:
In this paper, we first define the concept of bipolar single neutrosophic graphs as the generalization of bipolar fuzzy graphs, N-graphs, intuitionistic fuzzy graph, single valued neutrosophic graphs and bipolar intuitionistic fuzzy graphs.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Fuzzy graphs"

1

Hernandes, Fabio. "Algoritmos para problemas de grafos com incertezas." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260595.

Full text
Abstract:
Orientadores: Akebo Yamakami, Marcia Tomie Takahashi
Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-08T13:05:12Z (GMT). No. of bitstreams: 1 Hernandes_Fabio_D.pdf: 995506 bytes, checksum: c4a27a827d2ca5ec109571ba03e4e094 (MD5) Previous issue date: 2007
Resumo: A teoria de grafos é uma importante área da programação matemática, tendo um importante papel em áreas tais como engenharia e pesquisa operacional. Em particular, ela fornece ferramentas para tratar problemas de redes (tais como: alocação, caminho mínimo, fluxo máximo, etc.), que têm aplicações em diversas subáreas da engenharia (por exemplo: telecomunicações, transporte, manufatura, etc.). Estas aplicações podem, entretanto, possuir incertezas em seus parâmetros ou em sua estrutura. Baseado nisto, este trabalho trata de algumas importantes aplicações de problemas em grafos com incertezas em seus parâmetros ou estruturas e propõe algoritmos para encontrar suas soluções. As aplicações estudadas são: problemas de caminho mínimo, problemas de fluxo máximo, problemas de fluxo de custo mínimo e problemas de coloração de grafos. As incertezas são modeladas por meio da teoria dos conjuntos fuzzy, que tem sido aplicada com sucesso em problemas com incertezas e imprecisões
Abstract: The graph theory is an important area of mathematical programming, it has an important role in fields such as engineering and operational research. In particular, it provides the tools to tackle network problems (e.g. allocation, shortest path, maximum flow, etc), which have applications in several sub areas of engineering (e.g. telecommunications, transportation, manufacturing, etc). These applications can, however, possess uncertainties in their parameters or in their structure. Based on that, this work addresses some important applications of graph problems with uncertainties in their structure or parameters and proposes algorithms to find the solution to them. The applications studied are: shortest path problems, maximum flow problems, minimum cost flow problems and graph coloring problems. The uncertainties are modeled by means of the fuzzy sets theory, which has been successfully applied to problems with uncertainties and vagueness
Doutorado
Automação
Doutor em Engenharia Elétrica
APA, Harvard, Vancouver, ISO, and other styles
2

Stix, Volker. "Finding all maximal cliques in dynamic graphs." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1198/1/document.pdf.

Full text
Abstract:
Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like G_t=(V,E_t), where E_(t-1) in E_t, t=1,... ,T; E_0=(). In this article algorithms are provided to track all maximal cliques in a fully dynamic graph. It is naturally to raise the question about the maximum clique, having all maximal cliques. Therefore this article discusses potentials and drawbacks for this problem as well. (author's abstract)
Series: Working Papers on Information Systems, Information Business and Operations
APA, Harvard, Vancouver, ISO, and other styles
3

Bertei, Alex. "Uma abordagem relacional para gramática de grafos Fuzzy." Universidade Federal de Pelotas, 2017. http://repositorio.ufpel.edu.br:8080/handle/prefix/3838.

Full text
Abstract:
Submitted by Aline Batista (alinehb.ufpel@gmail.com) on 2018-04-18T14:30:20Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertacao_Alex_Bertei.pdf: 2631033 bytes, checksum: 64d9253595f75230a7d83432fb89d6e9 (MD5)
Approved for entry into archive by Aline Batista (alinehb.ufpel@gmail.com) on 2018-04-19T14:42:33Z (GMT) No. of bitstreams: 2 Dissertacao_Alex_Bertei.pdf: 2631033 bytes, checksum: 64d9253595f75230a7d83432fb89d6e9 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2018-04-19T14:42:41Z (GMT). No. of bitstreams: 2 Dissertacao_Alex_Bertei.pdf: 2631033 bytes, checksum: 64d9253595f75230a7d83432fb89d6e9 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-03-13
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
Com o passar dos dias os sistemas de software e hardware evoluem e ficam cada vez mais complexos e sofisticados. Como consequência especificar esses sistemas se torna uma tarefa difícil e trabalhosa. No sentido de assegurar certas propriedades de um sistema, este deve ser especificado por intermédio de uma linguagem que ofereça métodos de análise. Para realizar essas especificações temos diversas técnicas e metodologias, onde algumas técnicas que são disponíveis no mercado podem gerar resultados diferentes do que o especificado e esperado. Para realizar a correção deste problema, tem-se a necessidade de se utilizar métodos formais para gerar a especificação e verificação de sistemas. Sistemas que utilizam métodos formais são especificados formalmente através de um modelo matemático. Gramática de Grafos é uma linguagem formal bastante propícia para especificar sistemas complexos, é interessante o uso delas, pelo fato de possuírem inúmeras técnicas para a verificação e especificação de sistemas que são representadas nesta linguagem, além do que, elas possuem um layout gráfico, que as torna bastante intuitivas, por isso elas são uma linguagem de fácil entendimento. Gramática de Grafos Fuzzy são obtidas através da generalização das gramáticas de grafos, elas são constituídas por vértices e arestas com valores de pertinência associados, dentro do intervalo 0 e 1. Devido a inexistência de técnicas e ferramentas de análise para gramática de grafos fuzzy, o seu uso ainda é bastante restrito. Uma maneira de permitir a análise de sistemas especificados em gramática de grafos fuzzy é através da extensão das abordagens existentes para gramática de grafos, adicionando os conceitos de pertinência aos componentes dos grafos e para isso foi necessário definir gramáticas de grafos fuzzy tipados. Já existe uma abordagem relacional para gramática de grafos que permite o uso dos provadores de teoremas da ferramenta Rodin, utilizando a linguagem Event-B. Desta forma, a proposta deste trabalho é estender essa abordagem de gramática de grafos adicionando os conceitos fuzzy para permitir utilizar a mesma abordagem para analisar gramática de grafos fuzzy, surgindo assim um método de análise para esse tipo de gramática.
With the passing of days software and hardware systems evolve and become increasingly sophisticated and complex. As a consequence, specifying these systems becomes a difficult and laborious task. In order to ensure certain properties of a system, it must be specified through a language that offers methods of analysis. To realize these specifications we have several techniques and methodologies, where some techniques that are available in the market can generate different results than the specified and expected. To perform the correction of this problem, there is the need of using formal methods for generate the specification and verification systems. Systems that use formal methods are formally specified through a mathematical model. Grammar Graphs is a very suitable to specify complex systems formal language, is interesting to use them because they have innumerable techniques for the verification and specification of systems that are represented in this language, besides that, they have a graphical layout, which makes them very intuitive, so they are an easy-to-understand language. Fuzzy graph grammars are obtained through the generalization of graph grammars, they are constituted by vertices and edges with associated membership values within the interval 0 and 1. Due to the inexistence of techniques and analysis tools for fuzzy graph grammars, its use is still quite restricted. One way to allow the analysis of systems specified in fuzzy graphs grammars is the extension of existing approaches for graphs grammars, adding the concepts of pertinence to the components of graphs and for this it was necessary to define fuzzy graph grammars typed. There is already a relational approach to graph grammar that allows the use of the theorems of the Rodin tool using the language Event-B. In this way, the purpose of this work is to extend this approach of grammars of graphs by adding the fuzzy concepts to allow to use the same approach to analyze fuzzy graphs grammars, thus appearing a method of analysis for this type of grammar.
APA, Harvard, Vancouver, ISO, and other styles
4

Tzanavari, Aimilia. "User modeling for intelligent human-computer interaction." Thesis, University of Bristol, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364961.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Muna, Izza Hasanul. "Modely a metody pro svozové problému v logistice." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-401586.

Full text
Abstract:
The thesis focuses on how to optimize vehicle routes for distributing logistics. This vehicle route optimization is known as a vehicle routing problem (VRP). The VRP has been extended in numerous directions for instance by some variations that can be combined. One of the extension forms of VRP is a capacitated VRP with stochastics demands (CVRPSD), where the vehicle capacity limit has a non-zero probability of being violated on any route. So, a failure to satisfy the amount of demand can appear. A strategy is required for updating the routes in case of such an event. This strategy is called as recourse action in the thesis. The main objective of the research is how to design the model of CVRPSD and find the optimal solution. The EEV (Expected Effective Value) and FCM (Fuzzy C-Means) – TSP (Travelling Salesman Problem) approaches are described and used to solve CVRPSD. Results have confirmed that the EEV approach has given a better performance than FCM-TSP for solving CVRPSD in small instances. But EEV has disadvantage, that the EEV is not capable to solve big instances in an acceptable running time because of complexity of the problem. In the real situation, the FCM –TSP approach is more suitable for implementations than the EEV because the FCM – TSP can find the solution in a shorter time. The disadvantage of this algorithm is that the computational time depends on the number of customers in a cluster.
APA, Harvard, Vancouver, ISO, and other styles
6

Luqman, Muhammad Muzzamil. "Fuzzy multilevel graph embedding for recognition, indexing and retrieval of graphic document images." Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4005/document.

Full text
Abstract:
Cette thèse aborde le problème du manque de performance des outils exploitant des représentationsà base de graphes en reconnaissance des formes. Nous proposons de contribuer aux nouvellesméthodes proposant de tirer partie, à la fois, de la richesse des méthodes structurelles et de la rapidité des méthodes de reconnaissance de formes statistiques. Deux principales contributions sontprésentées dans ce manuscrit. La première correspond à la proposition d'une nouvelle méthode deprojection explicite de graphes procédant par analyse multi-facettes des graphes. Cette méthodeeffectue une caractérisation des graphes suivant différents niveaux qui correspondent, selon nous,aux point-clés des représentations à base de graphes. Il s'agit de capturer l'information portéepar un graphe au niveau global, au niveau structure et au niveau local ou élémentaire. Ces informationscapturées sont encapsulés dans un vecteur de caractéristiques numériques employantdes histogrammes flous. La méthode proposée utilise, de plus, un mécanisme d'apprentissage nonsupervisée pour adapter automatiquement ses paramètres en fonction de la base de graphes àtraiter sans nécessité de phase d'apprentissage préalable. La deuxième contribution correspondà la mise en place d'une architecture pour l'indexation de masses de graphes afin de permettre,par la suite, la recherche de sous-graphes présents dans cette base. Cette architecture utilise laméthode précédente de projection explicite de graphes appliquée sur toutes les cliques d'ordre 2pouvant être extraites des graphes présents dans la base à indexer afin de pouvoir les classifier.Cette classification permet de constituer l'index qui sert de base à la description des graphes etdonc à leur indexation en ne nécessitant aucune base d'apprentissage pré-étiquetées. La méthodeproposée est applicable à de nombreux domaines, apportant la souplesse d'un système de requêtepar l'exemple et la granularité des techniques d'extraction ciblée (focused retrieval)
This thesis addresses the problem of lack of efficient computational tools for graph based structural pattern recognition approaches and proposes to exploit computational strength of statistical pattern recognition. It has two fold contributions. The first contribution is a new method of explicit graph embedding. The proposed graph embedding method exploits multilevel analysis of graph for extracting graph level information, structural level information and elementary level information from graphs. It embeds this information into a numeric feature vector. The method employs fuzzy overlapping trapezoidal intervals for addressing the noise sensitivity of graph representations and for minimizing the information loss while mapping from continuous graph space to discrete vector space. The method has unsupervised learning abilities and is capable of automatically adapting its parameters to underlying graph dataset. The second contribution is a framework for automatic indexing of graph repositories for graph retrieval and subgraph spotting. This framework exploits explicit graph embedding for representing the cliques of order 2 by numeric feature vectors, together with classification and clustering tools for automatically indexing a graph repository. It does not require a labeled learning set and can be easily deployed to a range of application domains, offering ease of query by example (QBE) and granularity of focused retrieval
APA, Harvard, Vancouver, ISO, and other styles
7

Slama, Olfa. "Flexible querying of RDF databases : a contribution based on fuzzy logic." Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S089/document.

Full text
Abstract:
Cette thèse porte sur la définition d'une approche flexible pour interroger des graphes RDF à la fois classiques et flous. Cette approche, basée sur la théorie des ensembles flous, permet d'étendre SPARQL qui est le langage de requête standardisé W3C pour RDF, de manière à pouvoir exprimer i) des préférences utilisateur floues sur les données (par exemple, l'année de publication d'un album est récente) et sur la structure du graphe (par exemple, le chemin entre deux amis doit être court) et ii) des préférences utilisateur plus complexes, prenant la forme de propositions quantifiées floues (par exemple, la plupart des albums qui sont recommandés par un artiste, sont très bien notés et ont été créés par un jeune ami de cet artiste). Nous avons effectué des expérimentations afin d'étudier les performances de cette approche. L'objectif principal de ces expérimentations était de montrer que le coût supplémentaire dû à l'introduction du flou reste limité/acceptable. Nous avons également étudié, dans un cadre plus général, celui de bases de données graphe, la question de l'intégration du même type de propositions quantifiées floues dans une extension floue de Cypher qui est un langage déclaratif pour l'interrogation des bases de données graphe classiques. Les résultats expérimentaux obtenus montrent que le coût supplémentaire induit par la présence de conditions quantifiées floues dans les requêtes reste également très limité dans ce cas
This thesis concerns the definition of a flexible approach for querying both crisp and fuzzy RDF graphs. This approach, based on the theory of fuzzy sets, makes it possible to extend SPARQL which is the W3C-standardised query language for RDF, so as to be able to express i) fuzzy user preferences on data (e.g., the release year of an album is recent) and on the structure of the data graph (e.g., the path between two friends is required to be short) and ii) more complex user preferences, namely, fuzzy quantified statements (e.g., most of the albums that are recommended by an artist, are highly rated and have been created by a young friend of this artist). We performed some experiments in order to study the performances of this approach. The main objective of these experiments was to show that the extra cost due to the introduction of fuzziness remains limited/acceptable. We also investigated, in a more general framework, namely graph databases, the issue of integrating the same type of fuzzy quantified statements in a fuzzy extension of Cypher which is a declarative language for querying (crisp) graph databases. Some experimental results are reported and show that the extra cost induced by the fuzzy quantified nature of the queries also remains very limited
APA, Harvard, Vancouver, ISO, and other styles
8

Demircioglu, Ersan. "A Novel Refinement Method For Automatic Image Annotation Systems." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613346/index.pdf.

Full text
Abstract:
Image annotation could be defined as the process of assigning a set of content related words to the image. An automatic image annotation system constructs the relationship between words and low level visual descriptors, which are extracted from images and by using these relationships annotates a newly seen image. The high demand on image annotation requirement increases the need to automatic image annotation systems. However, performances of current annotation methods are far from practical usage. The most common problem of current methods is the gap between semantic words and low level visual descriptors. Because of the semantic gap, annotation results of these methods contain irrelevant noisy words. To give more relevant results, refinement methods should be applied to classical image annotation outputs. In this work, we represent a novel refinement approach for image annotation problem. The proposed system attacks the semantic gap problem by using the relationship between the words which are obtained from the dataset. Establishment of this relationship is the most crucial problem of the refinement process. In this study, we suggest a probabilistic and fuzzy approach for modelling the relationship among the words in the vocabulary, which is then employed to generate candidate annotations, based on the output of the image annotator. Candidate annotations are represented by a set of relational graphs. Finally, one of the generated candidate annotations is selected as a refined annotation result by using a clique optimization technique applied to the candidate annotation graph.
APA, Harvard, Vancouver, ISO, and other styles
9

Verga, Juliana 1984. "Algoritmo para resolução do problema de fluxo multiproduto Fuzzy." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261869.

Full text
Abstract:
Orientador: Akebo Yamakami
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-14T08:52:58Z (GMT). No. of bitstreams: 1 Verga_Juliana_M.pdf: 625534 bytes, checksum: 396d5b5c1dafff5b2fbb632e185c4a72 (MD5) Previous issue date: 2009
Resumo: A teoria dos grafos é comumente utilizada na área da engenharia para resolver problemas que podem ser representados na forma de redes. Dentre diversos problemas abordados, o problema de fluxo multiproduto é um dos que também podem ser modelados por grafos. Este trabalho apresenta uma proposta de solução para o problema de fluxo multiproduto fuzzy. O problema foi modelado através de um grafo, cujos nós representam pontos de oferta e demanda de produtos, os quais trafegam pelos arcos da rede. O algoritmo proposto visa encontrar soluções factiveis e boas para o problema de fluxo multiproduto fuzzy em redes com incertezas nos custos e capacidades, contendo múltiplas origens e múltiplos destinos. As incertezas são modeladas por meio da teoria dos conjuntos fuzzy, que tem sido aplicada com sucesso em problemas com incertezas.
Abstract: The graph theory is commonly used in the area of engineering to solve problems that can be represented in the form of nets. Among several problems, the multicommodity flow problem is one that can be modeled by graphs. This work presents an approach for solving the fuzzy multicommodity flow problem. The problem was modeled through a graph whose nodes represent points of supply and demand of commodities, which pass through arcs of the network. Our algorithm aims to find a set of good feasible solutions for the fuzzy multicommodity flow problem in networks with uncertainties in the costs and capacities, containing multiple origins and multiple destinations. The uncertainties are modeled by means of the fuzzy sets theory, which has been successfully applied to problems with uncertainties.
Mestrado
Automação
Mestre em Engenharia Elétrica
APA, Harvard, Vancouver, ISO, and other styles
10

Lu, Xi. "Polycultural Interactions: Fuzzy Identity." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3784.

Full text
Abstract:
“Robin D.G. Kelley coined the term polyculturalism as an alternative to multiculturalism, ‘since the latter often implies that cultures are fixed, discrete entities that exist side by side—a kind of zoological approach to culture.’ ” Polyculturalism assumes the whole world’s cultures are interactive and fluid instead of independent and static, and individuals’ relationship to cultures are complex and cannot be categorized. Yet an individual constitutes multiple cultures, and individual identity embraces the various forms of culture in all aspects of one’s life. My research examines how polyculturalism affects aspects of communications among people who hold a multiplicity of voices. It uses my personal experiences as the basis for work that expresses the effects of mistranslation and cultural mixing and seeks to communicate them to people of various cultural backgrounds.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Fuzzy graphs"

1

Mordeson, John N., and Premchand S. Nair, eds. Fuzzy Graphs and Fuzzy Hypergraphs. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1854-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Akram, Muhammad. m−Polar Fuzzy Graphs. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-03751-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cao, Tru Hoang. Conceptual Graphs and Fuzzy Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14087-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Akram, Muhammad, Musavarah Sarwar, and Wieslaw A. Dudek. Graphs for the Analysis of Bipolar Fuzzy Information. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8756-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cao, Tru. Conceptual graphs and fuzzy logic: A fusion for representing and reasoning with linguistic information. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mathew, Sunil, John N. Mordeson, and Davender S. Malik. Fuzzy Graph Theory. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-71407-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pal, Madhumangal, Sovan Samanta, and Ganesh Ghorai. Modern Trends in Fuzzy Graph Theory. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8803-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mordeson, John N., and Sunil Mathew. Advanced Topics in Fuzzy Graph Theory. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-04215-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mordeson, John N., Sunil Mathew, and Davender S. Malik. Fuzzy Graph Theory with Applications to Human Trafficking. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76454-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fuzzy baseball. New York: Papercutz, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Fuzzy graphs"

1

Mordeson, John N., and Premchand S. Nair. "Fuzzy Graphs." In Fuzzy Graphs and Fuzzy Hypergraphs, 19–81. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1854-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mordeson, John N., and Premchand S. Nair. "Fuzzy Graphs." In Fuzzy Mathematics, 21–65. Heidelberg: Physica-Verlag HD, 2001. http://dx.doi.org/10.1007/978-3-7908-1808-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mathew, Sunil, John N. Mordeson, and Davender S. Malik. "Fuzzy Graphs." In Fuzzy Graph Theory, 13–83. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71407-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mordeson, John N., and Premchand S. Nair. "Applications of Fuzzy Graphs." In Fuzzy Graphs and Fuzzy Hypergraphs, 83–133. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1854-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mathew, Sunil, John N. Mordeson, and Davender S. Malik. "Bipolar Fuzzy Graphs." In Fuzzy Graph Theory, 271–306. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71407-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mordeson, John N., Sunil Mathew, and Davender S. Malik. "Fuzzy Incidence Graphs." In Fuzzy Graph Theory with Applications to Human Trafficking, 87–137. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76454-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wuwongse, Vilas, and Mario Manzano. "Fuzzy conceptual graphs." In Conceptual Graphs for Knowledge Representation, 430–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56979-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cao, Tru Hoang. "Fuzzy Conceptual Graphs." In Conceptual Graphs and Fuzzy Logic, 5–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14087-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pal, Madhumangal, Sovan Samanta, and Ganesh Ghorai. "Fuzzy Planar Graphs." In Modern Trends in Fuzzy Graph Theory, 99–114. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8803-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pal, Madhumangal, Sovan Samanta, and Ganesh Ghorai. "Fuzzy Competition Graphs." In Modern Trends in Fuzzy Graph Theory, 125–44. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8803-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fuzzy graphs"

1

Parvathi, R., M. G. Karunambigai, and Krassimir T. Atanassov. "Operations on intuitionistic fuzzy graphs." In 2009 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2009. http://dx.doi.org/10.1109/fuzzy.2009.5277067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Karunambigai, M. G., M. Akram, K. Palanivel, and S. Sivasankar. "Domination in bipolar fuzzy graphs." In 2013 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2013. http://dx.doi.org/10.1109/fuzz-ieee.2013.6622326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Guanfeng, Weijun Li, and Hairong Wang. "Querying Fuzzy RDF Knowledge Graphs Data." In 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2020. http://dx.doi.org/10.1109/fuzz48607.2020.9177616.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rao T., Nageswara, Muneera Abdul, Jonnalagadda Venkateswara Rao, M. N. Srinivas, and Sateesh Kumar D. "Trends on dominations of fuzzy graphs and anti fuzzy graphs." In ESSENCE OF MATHEMATICS IN ENGINEERING APPLICATIONS: EMEA-2020. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0066458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rao T., Nageswara, Muneera Abdul, Jonnalagadda Venkateswara Rao, M. N. Srinivas, and Sateesh Kumar D. "Trends on dominations of fuzzy graphs and anti fuzzy graphs." In ESSENCE OF MATHEMATICS IN ENGINEERING APPLICATIONS: EMEA-2020. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0066458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Karunambigai, M. G., R. Parvathi, and O. K. Kalaivani. "A study on atanassov's intuitionistic fuzzy graphs." In 2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2011. http://dx.doi.org/10.1109/fuzzy.2011.6007416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shah, Faaiz, Arnaud Castelltort, and Anne Laurent. "Extracting Fuzzy Gradual Patterns from Property Graphs." In 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2019. http://dx.doi.org/10.1109/fuzz-ieee.2019.8858936.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stokes, Klara, and Vicencc Torra. "On some clustering approaches for graphs." In 2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2011. http://dx.doi.org/10.1109/fuzzy.2011.6007447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zihni, Onur, and Yıldıray Çelik. "Irregular intuitionistic fuzzy graphs." In INTERNATIONAL CONFERENCE ON ADVANCES IN NATURAL AND APPLIED SCIENCES: ICANAS 2016. Author(s), 2016. http://dx.doi.org/10.1063/1.4945868.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bharathi, T., and S. Felixia. "Bipolar felicitous fuzzy graphs." In INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0071535.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Fuzzy graphs' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography