On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.
Luis Pedro MontejanoIgnasi SauPublished in: WG (2015)
Keyphrases
- weighted graph
- connected components
- strongly connected
- disjoint paths
- directed graph
- edge detection
- undirected graph
- graph theory
- graph representation
- edge weights
- adjacency graph
- structured data
- graph connectivity
- graph based algorithm
- topological information
- homology generators
- graph theoretic
- space complexity
- neural network
- directed acyclic graph
- edge detector
- decision problems
- graph partitioning
- edge information
- graph model
- multiscale
- image segmentation