Login / Signup
The Complexity of Testing Whether a Graph is a Superconcentrator.
Manuel Blum
Richard M. Karp
Oliver Vornberger
Christos H. Papadimitriou
Mihalis Yannakakis
Published in:
Inf. Process. Lett. (1981)
Keyphrases
</>
random walk
bipartite graph
computational complexity
graph representation
computational cost
worst case
weighted graph
graph model
upper bound
graph cuts
test set
test cases
structured data
connected components
graph theory
graph structure