Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles.
Rija ErvesJanez ZerovnikPublished in: Discret. Appl. Math. (2015)
Keyphrases
- upper bound
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- lower bound
- disjoint paths
- strongly connected
- minimum weight
- graph structure
- approximation algorithms
- upper and lower bounds
- bipartite graph
- connected components
- directed acyclic graph
- fault diagnosis
- spanning tree
- hamiltonian cycle
- fault detection
- attributed graphs
- lower and upper bounds
- random walk
- graph partitioning
- graph theory
- constant factor
- tight bounds
- worst case
- graph representation
- graph model
- graph matching
- branch and bound
- graph theoretic
- shortest path
- edge detection
- average degree
- maximum cardinality