CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Minimum Spanning Tree with Rough Weights

by Sagarika Biswal, S. P. Mohanty
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 71 - Number 12
Year of Publication: 2013
Authors: Sagarika Biswal, S. P. Mohanty
10.5120/12412-9154

Sagarika Biswal, S. P. Mohanty . Minimum Spanning Tree with Rough Weights. International Journal of Computer Applications. 71, 12 ( June 2013), 27-32. DOI=10.5120/12412-9154

@article{ 10.5120/12412-9154,
author = { Sagarika Biswal, S. P. Mohanty },
title = { Minimum Spanning Tree with Rough Weights },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 71 },
number = { 12 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 27-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume71/number12/12412-9154/ },
doi = { 10.5120/12412-9154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:35:23.010875+05:30
%A Sagarika Biswal
%A S. P. Mohanty
%T Minimum Spanning Tree with Rough Weights
%J International Journal of Computer Applications
%@ 0975-8887
%V 71
%N 12
%P 27-32
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or non-obtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum spanning tree on a connected graph where the edges have rough weights.

References
  1. He, T, Chan, Y, Shi, K. , "Weighted rough graphs and its application", Proc of sixth International Conference on Intelligent System Design and Application (ISDA 2006), 1, IEEE Computer Soc. , 2006, 486-491
  2. He, T and Shi, K, " Rough graph and its structure", Journal of Shandong University, 6, 2006, 88-92
  3. Liang, M, Liang, B, Wei, L, Xu, X, "Edge rough graph and its application", Proc of Eighth Internaional Conference on Fuzzy Systems and Knowledge Discovery, 2011, 335-338
  4. Mohanty, S. P, Biswal, S, Pradhan,G, "Minimum spanning tree in fuzzy weighted rough graph", Int Journal of Engineering and Development", 10, 2012, 23-28
  5. Pawlak, Z, "Rough sets", Int Journal of Information and Computer Science", 11, 1982, 341-356
  6. Liu, B, "Uncertainty theory to its axiomatic foundation", 2004, Spinger-Verlag, Berlin.
  7. Liu, B, "Theory and practice of uncertain programming", 2002, Physical-Verlag, Heidelberg
  8. Liu, B, "Inequalities and convergence properties fuzzy and rough variables, ""Fuzzy Optimization and Decision Making, 2, 2003, 87-100
  9. Kundu, P, Kar, S, Maiti, M, "Some solid transportation models with crisp and rough costs", World Academy of Science, Engineering and Technology, 73, 2013, 185-192
Index Terms

Computer Science
Information Sciences

Keywords

Rough set rough variable connected graph spanning tree

Powered by PhDFocusTM