On the complexity of computing the k-restricted edge-connectivity of a graph.

Luis Pedro Montejano Ignasi Sau

Published in: CoRR (2015)

Keyphrases

weighted graph
connected components
strongly connected
graph connectivity
random walk
undirected graph
directed graph
data sets
edge information
structured data
graph representation
edge weights
graph model
polynomial time complexity
graph search
graph structure
computational complexity