Fuzzy Shortest Path For Steiner Tree Problem
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 4
Abstract
In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edge. Here, to solve the fuzzy shortest path using a new approach ranking method.
Authors and Affiliations
A. Nagoorgani , A. Mumtaj Begam
Keywords
Related Articles
- EP ID EP145064
- DOI -
- Views 97
- Downloads 0
Analysis and Simulations of Routing Protocols with Different Load Conditions of MANETs
In this paper, we have compared important characteristics of MANET proactive routing protocol (DSDV), reactive protocols (AODV, DSR and TORA) and hybrid protocol (ZRP). Extensive simulations are being carried out with di...
Design of a new search engine for the information search using image as an input key
It’s a long time we didn’t actually think about this. Whenever we need an image or the information regarding an image to be searched, we have to give a hint or the keyword related to the image. But think of a situation w...
MATHEMATICAL MODELING ON NETWORK FRACTIONAL ROUTING THROUGH INEQUALITIES
A Network is a set, directed, acyclic multigraph over which messages can be transmitted from source node to sink node. Linear programming is one of the most important optimization techniques to help decision making in ne...
Fuzzy time series forecasting of wheat production
The present study provides a foundation for the development and application of fuzzy time series model for short term agricultural production forecasting. The present study can provide an advantageous basis to Farm admin...
Survey on FPGA Routing Techniques
Field Programmable Gate Array (FPGA), a programmable integrated circuit, has gained great popularity in the circuit design. Routing is an important part of FPGA design step which determines the routing in horizontal and...