Computing the point-to-point shortest path: quotient space theory's application in complex network

Authors:
Fugui He;Yanping Zhang;Shu Zhao;Ling Zhang
Affiliations:
School of Computer Science and Technology, Anhui University, Hefei, China;School of Computer Science and Technology, Anhui University, Hefei, China;School of Computer Science and Technology, Anhui University, Hefei, China;School of Computer Science and Technology, Anhui University, Hefei, China
Venue:
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Year:
2010

Citing 9
Cited 1

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic

Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering
Human-Centric Information Processing Through Granular Modelling

Human-Centric Information Processing Through Granular Modelling
A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space

Fundamenta Informaticae
Better landmarks within reach

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Path queries on massive graphs based on multi-granular graph partitioning

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quotient space theory can represent the world at different granularity sizes and deal with complicated problems hierarchically. We present significant improvement to point-to-point shortest path based on quotient space theory in complex large-scale network. We propose the shortest path algorithm that is a heuristic method, in which evaluation function is based on community and hierarchical granularity decomposition of quotient space theory. In preprocessing, we decompose large-scale network into some communities using hierarchical granularity decomposition of quotient space theory, compute and store the minimum spanning trees in the communities and the shortest distance among communities. The implementation works on the large-scale road network. From experimental results, we know the proposed algorithm is effective and efficient in the road network of US.