[PDF] Top 20 Pospeševanje prodaje v družbi Levin d.o.o. : diplomsko delo
Has 10000 "Pospeševanje prodaje v družbi Levin d.o.o. : diplomsko delo" found on our website. Below are the top 20 most common "Pospeševanje prodaje v družbi Levin d.o.o. : diplomsko delo".
An algorithmic approach for finding minimum spanning tree in a intuitionistic fuzzy graph
... a spanning tree that has the lowest possible ...a spanning tree T of graph G which has the minimum cost among all the spanning tree of graph ...classical ... See full document
29
A new approach for finding minimum path in a network using triangular intuitionistic fuzzy number
... the fuzzy Shortest Path Problem (SPP) since it is central to lots of ...the fuzzy SPP, the fuzzy shortest length and the corresponding shortest paths are the useful information for the decision ...in ... See full document
15
An Algorithmic Approach on Finding Edge Dominating Set of Fuzzy Graph
... a fuzzy graph G is N ୱ (e ୧ ) = {e ୨ ∈ E(G)/ e ୨ is a strong arc in G and adjacent to e ୧ } ...a fuzzy graph ...a fuzzy graph G is a maximal edge dominating set if S − D is not ... See full document
11
Large Graph mining Approach for Cluster Analysis to Identify Critical Components within the Water Distribution System
... A Minimum Spanning Tree is an acyclic subgraph of a graph G, which contains all vertices from ...connected graph. A sub graph T=(V',E') of G is a spanning tree of G ... See full document
24
Searching Minimum Spanning Tree in a Type-2 Fuzzy Graph
... type-2 fuzzy weighted graph has been ...type-2 fuzzy weighted ...based approach of type-2 fuzzy sets is the computational complexity as we have to calculate the satisfaction function of ... See full document
27
Minimum Spanning Tree with Rough Weights
... Finding minimum spanning tree for a directed and undirected graph is a fundamental work in graph ...and fuzzy costs have been assigned to meet the ...undirected ... See full document
50
Intuitionistic Fuzzy Soft Graph
... of intuitionistic fuzzy soft graph, strong intuitionistic fuzzy soft graph, complete intutionistic fuzzy soft graph in this ...two Intuitionistic ... See full document
25
Minimum Spanning Tree based Clustering with Cluster Validity in Data Mining
... ABSTRACT: The minimum spanning tree clustering algorithm is used for detecting clusters with irregular boundaries. In this paper, we are considering two clustering algorithm .First we will take a set ... See full document
13
An elementary introduction to intuitionistic fuzzy soft graph
... of fuzzy graph. The notion of intuitionistic fuzzy set as a generalization of fuzzy set was introduced by Atanassov[3] which had a wider application in many ...of intuitionistic ... See full document
10
Boxdot and Star Products on Interval Valued Intuitionistic Fuzzy Graphs
... 2.1[10]A fuzzy graph is a pair of functions where is a fuzzy subset of a non-empty set and is a symmetric fuzzy relation on ...crisp graph of is denoted by where ... See full document
15
New Approaches to Find the Solution for the Intuitionistic Fuzzy Transportation Problem with Ranking of Intuitionistic Fuzzy Numbers
... investigate Intuitionistic Fuzzy Transportation Problem with the Trapezoidal Intuitionistic fuzzy ...of Intuitionistic Fuzzy Transportation Problem and a method to find the ... See full document
7
Isomorphic Properties of Edge Irregular Intuitionistic Fuzzy Graphs
... Strong Intuitionistic Fuzzy Graphs, Filomat 26(2012), ...KT, Intuitionistic fuzzy sets: theory and applications, Physica, New York, ...of fuzzy graphs, Pattern ...Constant ... See full document
6
Benchmarking attribute selection techniques for microarray data
... a minimum spanning tree, splitting the generated minimum spanning tree into clusters and selecting a representative feature from each ... See full document
19
Spanning tree with many leaves in quadratic graph
... A graph-theoretic perspective: Ecologists are familiar with two data structures commonly used to represent ...the graph. A graph represents a landscape as a set of nodes ...dispersal). Graph ... See full document
17
Review of Applications of Graph Theory in Engineering
... of graph in networking. In addition to that, Graph theoretic concepts have many applications in network engineering, such as connectivity, data gathering, Energy efficiency, traffic analysis, Finding ... See full document
5
An efficient delay-constrained minimum spanning tree heuristic
... delay-constrained minimum Steiner tree heuristics, can be used to construct delay-constrained broadcast trees, but most of them are too complicated ...delay-constrained minimum Steiner tree ... See full document
18
METAHEURISTIC APPROACHES FOR THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
... In this section, we describe an implementation of the simulated annealing algorithm for solving the QMSTP. Simulated annealing (SA) is a general- purpose optimization method that attempts to exploit an analogy between ... See full document
7
Experimental study of performance of minimum spanning tree algorithms
... traversal and finding Several have been developed for algorithms performance based be weights that can structures used by finding goal of this and Prim's have Spanning study is to for a [r] ... See full document
A Novel Approach for finding a Shortest Path Problem with Intuitionistic Fuzzy Network
... In this paper, an algorithm is developed for solving shortest path problem on a network with triangular intuitionistic fuzzy arc lengths, where the shortest path is identified using the concept of ranking ... See full document
12
Improving the Efficiency of Fast Using Semantic Similarity Algorithm
... using graph partitioning for initializing the feature ...association graph of the features. Then we use the graph partitioning algorithm to partition the features into several parts, ... See full document
9
Related subjects