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

Authors:
Fu-Gui He;Yan-Ping Zhang;Jie Chen;Ling Zhang
Affiliations:
School of Computer Science & Technology, Anhui University, Hefei, China and School of Information Engineering, West Anhui University, Lu'an, China;School of Computer Science & Technology, Anhui University, Hefei, China;School of Computer Science & Technology, Anhui University, Hefei, China;School of Computer Science & Technology, Anhui University, Hefei, China
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 11
Cited 0

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Algorithm 97: Shortest path

Communications of the ACM
The quotient space theory of problem solving

Fundamenta Informaticae - Special issue on the 9th international conference on rough sets, fuzzy sets, data mining and granular computing (RSFDGrC 2003)
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
Better landmarks within reach

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Computing the point-to-point shortest path: quotient space theory's application in complex network

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Goal directed shortest path queries using precomputed cluster distances

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quotient space theory can represent the world at different granularities and deal with complicated problems hierarchically. In this paper, we introduce a method for finding shortest path on massive graphs based on multi-granular graph partitioning. Path queries into two parts: preprocessing and query step. In preprocessing, we introduce a heuristic local community structure discovery algorithm to decompose massive graphs into some local communities and construct a sequence of hierarchical quotient spaces to describe hierarchy structure on massive graphs. In query, we improve evaluation function of heuristic search method in path query. The implementation works on massive networks. From experimental results, it can be stated that proposed algorithm is effective and efficient in transportation road networks of US.