Authors: Ling Zhang, Bo Zhang
Addresses: Artificial Intelligence Institute, Anhui University, Hefei, 230039, China. ' Tsinghua National Lab on Information Science and Technology; State Key Lab of Intelligent Technology & Systems; Department of Computer Science & Technology, Tsinghua University Beijing, 100084, China
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.
Keywords: tolerance relations; covering; maximal covering networks; approximation; network analysis; shortest path finding.
International Journal of Granular Computing, Rough Sets and Intelligent Systems, 2009 Vol.1 No.2, pp.179 - 189
Available online: 27 Aug 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article