A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph.
Jung-Heum ParkInsung IhmPublished in: Inf. Process. Lett. (2019)
Keyphrases
- strongly connected
- connected components
- solution path
- random walk
- directed graph
- multi dimensional
- graph theory
- graph representation
- selecting a small number
- neighborhood graph
- shortest path problem
- edge weights
- graph partitioning
- pairwise
- spanning tree
- bipartite graph
- graph clustering
- structured data
- dependency graph
- root node
- similarity measure
- hamiltonian path
- connected graphs
- neural network