A Vertical Breadth-First Multilevel Path Algorithm to Find All Paths in a Graph

This paper presents a novel approach called vertical breadth-first tree that utilizes vertical data structures to find all-length paths (including shortest paths) for all pairs of vertices in a graph. Identifying all available paths, including shortest paths is a relevant research problem as this concept can help solve a range of complex problems (e.g., routing problems in computer networks). The advancement of technology, complex computer networks, and extensive exchange of internet communications have resulted in massive increase in data. The conventional path finding algorithms do not scale well with the massive volume of data being communicated over the network and this motivates the need to develop some scalable and efficient path finding algorithms.

[1]  Qiang Ding,et al.  An efficient weighted nearest neighbour classifier using vertical data representation , 2007, Int. J. Bus. Intell. Data Min..

[2]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Christos Faloutsos,et al.  Big graph mining: algorithms and discoveries , 2013, SKDD.

[4]  Guy Desaulniers,et al.  The shortest path problem with forbidden paths , 2002, Eur. J. Oper. Res..

[5]  Subhash Suri,et al.  Finding the k shortest simple paths , 2007, ALENEX.

[6]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Stefan Szeider,et al.  Finding paths in graphs avoiding forbidden transitions , 2003, Discret. Appl. Math..

[8]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[9]  Maninder Singh,et al.  Validation of Inspection Reviews over Variable Features Set Threshold , 2017, 2017 International Conference on Machine Learning and Data Science (MLDS).

[10]  Cheng-Nan Lai.  On the construction of all shortest node-disjoint paths in star networks , 2016, Inf. Process. Lett..

[11]  Andrew V. Goldberg,et al.  On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs , 2016, SODA.

[12]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[13]  Takuya Akiba,et al.  Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.

[14]  Daniel J. Abadi,et al.  Scalable Semantic Web Data Management Using Vertical Partitioning , 2007, VLDB.

[15]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[16]  Salvatore Orlando,et al.  Fast and memory efficient mining of frequent closed itemsets , 2006, IEEE Transactions on Knowledge and Data Engineering.

[17]  Philip M. Spira,et al.  A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..

[18]  Maninder Singh,et al.  An Empirical Investigation to Overcome Class-Imbalance in Inspection Reviews , 2017, 2017 International Conference on Machine Learning and Data Science (MLDS).

[19]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.