C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Single-source three-disjoint path covers in cubes of connected graphs.
Jung-Heum Park
Insung Ihm
Published in:
Inf. Process. Lett. (2013)
Keyphrases
</>
single source
shortest path problem
shortest path
connected graphs
multi source
multicast tree
combinatorial optimization problems
information fusion
neural network
directed graph
closed form
data fusion
directed acyclic graph
random walk
data model
pairwise
bayesian networks
social networks
database