Login / Signup
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs.
Jung-Heum Park
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
graph matching
graph theory
pairwise
shortest path
graph databases
structured objects
graph representation
graph model
master slave
optimal path
parallel algorithm
semi supervised
neural network
spanning tree
graph theoretic
graph clustering
website
social networks