A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph.
Insung IhmJung-Heum ParkPublished in: Discret. Appl. Math. (2017)
Keyphrases
- strongly connected
- connected components
- graph theory
- maximum clique
- graph representation
- structured data
- graph model
- bipartite graph
- shortest path problem
- path length
- neighborhood graph
- graph matching
- dependency graph
- shortest path
- multi dimensional
- graph search
- graph clustering
- graph structure
- graph partitioning
- weighted graph
- social networks
- data cube
- binary images
- pairwise
- metadata