Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs.
Shinhaeng JoJung-Heum ParkKyung-Yong ChwaPublished in: Inf. Sci. (2013)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- undirected graph
- graph databases
- graph matching
- weighted graph
- parallel algorithm
- edge weights
- graph representation
- graph mining
- graph theoretic
- adjacency matrix
- shortest path
- bipartite networks
- graph clustering
- vertex set
- genetic algorithm
- endpoints
- directed graph
- pairwise
- graph structure
- graph theory
- master slave
- strongly connected
- search engine