Network Routing Problem in Multigraph
Journal Title: International Research Journal of Computer Science - Year 2016, Vol 0, Issue 0
Abstract
This paper tries to find an easy method for solving the problem of routing in computer network where the network is using multigraph. This is done mainly using comparison of weight or cost of various multi arcs between any two nodes. This theory can be implemented in real life to solve Network Routing Problem in Multigraph.
Authors and Affiliations
Siddhartha Sankar Biswas
Keywords
Related Articles
- EP ID EP182436
- DOI -
- Views 116
- Downloads 0
Exploring Regression Techniques for Predictions of Wheat and Rice Prices in India
Agriculture products play an important role in the economy of the country. In India, Wheat and Rice are the two major agriculture products and lots of economical decisions are taken by considering the prices of these agr...
Programming Modes and Performance of Raspberry-Pi Clusters
In present times, updated information and knowledge has become readily accessible to researchers, enthusiasts, developers, and academics through the Internet on many different subjects for wider areas of application. The...
ARDUINO-BASED AUTOMATIC MOTORCYCLE CHAIN LUBRICATION DESIGN
In recent years, we can see the increasing growth of the motorcycles. The motorcycle riders frequently forget and ignore chain maintenance problems due to their daily busyness and routines thereby making them forget and...
Block Based Algorithms for Estimating Motion
In this paper we are discussing about ME in video compression that to specifically about the algorithms used for it. Here we can see the different types of BMA which are implemented and compared, which includes from some...
CLUSTERING ALGORITHMS AND THEIR APPLICATIONS IN CLOUD COMPUTING ENVIRONMENT
Cloud computing is Internet-based computing that provides shared computer processing resources and data to computers and other devices on demand. Cloud computing is the hottest purpose built architecture created to suppo...