Share

Neutrosophic Graph Theory and Algorithms

Download Neutrosophic Graph Theory and Algorithms PDF Online Free

Author :
Release : 2019-10-25
Genre : Computers
Kind : eBook
Book Rating : 150/5 ( reviews)

GET EBOOK


Book Synopsis Neutrosophic Graph Theory and Algorithms by : Smarandache, Florentin

Download or read book Neutrosophic Graph Theory and Algorithms written by Smarandache, Florentin. This book was released on 2019-10-25. Available in PDF, EPUB and Kindle. Book excerpt: Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs

Download A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs by : Arindam Dey

Download or read book A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs written by Arindam Dey. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length.We define this type of MST as neutrosophic minimum spanning tree (NMST).

Spanning Tree Problem with Neutrosophic Edge Weights

Download Spanning Tree Problem with Neutrosophic Edge Weights PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Spanning Tree Problem with Neutrosophic Edge Weights by : Said Broumi

Download or read book Spanning Tree Problem with Neutrosophic Edge Weights written by Said Broumi. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers.

Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem

Download Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem by : Said Broumi

Download or read book Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem written by Said Broumi. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network.

An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut

Download An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut by : Yanhui Guo

Download or read book An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut written by Yanhui Guo. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC).

You may also like...