On the complexity of computing the k-restricted edge-connectivity of a graph.
Luis Pedro MontejanoIgnasi SauPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- weighted graph
- connected components
- strongly connected
- graph model
- graph connectivity
- edge information
- graph structure
- graph theory
- undirected graph
- edge weights
- graph matching
- bipartite graph
- edge detection
- vertex set
- graph representation
- computational cost
- computational complexity
- graph partitioning
- spanning tree
- data sets
- polynomial time complexity
- neural network
- graph construction
- binary images
- space complexity
- random walk
- edge detector