Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges.
Jing LiShiying WangDi LiuShangwei LinPublished in: Inf. Sci. (2011)
Keyphrases
- undirected graph
- weighted graph
- edge weights
- directed graph
- edge information
- edge detector
- disjoint paths
- shortest path
- edge map
- spanning tree
- edge enhancement
- edge detection algorithm
- edge detection
- multiple scales
- minimum cost
- edge localization
- edge linking
- step edges
- vertex set
- edge direction
- directed acyclic graph
- approximation algorithms
- edge pixels
- homogeneous areas
- detected edges
- junction detection
- strongly connected
- random walk
- nodes of a graph
- edge segments
- edge directed
- edge orientation
- image edges
- edge strength
- edge points
- graph structure
- data cube
- high curvature
- subpixel accuracy
- gradient direction
- gradient field
- densely connected
- canny edge
- image gradient
- model based diagnosis
- complex networks
- directed edges
- scale space