Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements.
Jing LiChris MelekianShurong ZuoEddie ChengPublished in: Int. J. Found. Comput. Sci. (2020)
Keyphrases
- bipartite networks
- social networks
- path selection
- path length
- bipartite graph
- multiple faults
- data sets
- graph model
- network analysis
- real valued
- multi dimensional
- computer networks
- end to end
- network structure
- path planning
- community detection
- fault diagnosis
- network design
- heterogeneous networks
- complex systems
- shortest path
- link failure
- pairwise