Paired many-to-many disjoint path covers in restricted hypercube-like graphs.

Published in: Theor. Comput. Sci. (2016)

Keyphrases

pairwise
shortest path
parallel algorithm
graph matching
graph theoretic
graph theory
data sets
query processing
weighted graph
graph representation
finding the shortest path
database
parallel computation
optimal path
graph model
graph mining
bipartite graph
pattern recognition
bayesian networks
social networks