The theory and application of tolerance relations Online publication date: Thu, 27-Aug-2009
by Ling Zhang, Bo Zhang
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 1, No. 2, 2009
Abstract: We present four different but equivalent statements of tolerance relations. Based on the connection among tolerance relation, covering and approximation, we introduce the concept of maximal covering network and apply it to complex network analysis. A new algorithm for the shortest path finding of networks is given.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com