Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults.
Jung-Heum ParkPublished in: Int. J. Found. Comput. Sci. (2023)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- bipartite graph
- graph model
- vertex set
- disjoint paths
- graph partitioning
- shortest path
- minimum cost
- directed graph
- spanning tree
- strongly connected
- fault diagnosis
- approximation algorithms
- fault detection
- complex networks
- connected components
- graph structure
- random graphs
- minimum spanning trees
- graph theory
- graph databases
- model based diagnosis
- graph representation
- graph clustering
- directed acyclic graph
- subgraph isomorphism
- neural network
- fault model
- densely connected
- edge information
- bipartite networks
- adjacency graph
- root cause
- graph mining
- real valued
- test cases
- fuzzy logic
- pairwise
- image segmentation
- image processing