Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
Janez ZerovnikRija ErvesPublished in: CoRR (2012)
Keyphrases
- upper bound
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- lower bound
- disjoint paths
- minimum weight
- strongly connected
- directed acyclic graph
- graph theory
- spanning tree
- approximation algorithms
- upper and lower bounds
- fault detection
- graph representation
- bipartite graph
- graph structure
- connected components
- random walk
- fault diagnosis
- labeled graphs
- tight bounds
- edge information
- attributed graphs
- efficiently computable
- random graphs
- branch and bound algorithm
- structured data
- edge detection
- np hard
- polar coordinates
- graph partitioning
- complex networks
- input image