Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs.
Shiying WangKai FengYubao GuoPublished in: Int. J. Found. Comput. Sci. (2015)
Keyphrases
- sufficient conditions
- weighted graph
- graph partitioning
- undirected graph
- strongly connected
- fixed point
- exponential stability
- lyapunov function
- directed graph
- asymptotic stability
- graph model
- planar curves
- linear systems
- connected components
- shortest path
- optimal policy
- equilibrium point
- edge weights
- image segmentation
- chaotic neural network
- mathematical model