The complexity of testing whether a graph is a superconcentrator

Information Processing Letters

Volumn 13, Issue 4-5, 1981, Pages 164-167

  Blum, M ^a   Karp, R M ^a   Vornberger, O ^a   Papadimitriu, C H ^b   Yannakakis, M ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Concentrator; NP completeness; superconcentrator

Indexed keywords

MATHEMATICAL TECHNIQUES;

EID: 0019697885     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(81)90050-8     Document Type: Article

References (8)

1. Explicit construction of linear size superconcentrators
2. On representations of subsets
3. 5/2 algorithm for maximum matching in bipartite graphs
4. Explicit construction of concentrators
5. Superconcentrators
6. On the complexity of a concentrator
7. On nonlinear lower bounds in computational complexity