The exact distance to destination in undirected world


Shortest distance queries are essential not only in graph analysis and graph mining tasks but also in database applications, when a large graph needs to be dealt with. Such shortest distance queries are frequently issued by end-users or requested as a subroutine in real applications. For intensive queries on large graphs, it is impractical to compute… (More)
DOI: 10.1007/s00778-012-0274-x


31 Figures and Tables