The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree.
Hongwei QiaoJixiang MengEminjan SabirPublished in: Discret. Appl. Math. (2024)
Keyphrases
- fault tolerant
- fault tolerance
- minimum spanning trees
- spanning tree
- weighted graph
- distributed systems
- undirected graph
- load balancing
- edge weights
- minimum spanning tree
- graph structure
- tree structure
- state machine
- root node
- minimum cost
- shortest path
- high availability
- strongly connected
- pairwise
- approximate string matching
- safety critical
- graph matching
- multimedia
- database management systems
- edge detection
- response time
- database systems