Publication Details
Title: The Complexity of Testing Whether a Graph is a Superconcentrator
Author: M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis
Group: Algorithms
Date: 1981
PDF: [Not available online]
Bibliographic Information:
Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7
Bibliographic Reference:
M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis. The Complexity of Testing Whether a Graph is a Superconcentrator. Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7, 1981
Author: M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis
Group: Algorithms
Date: 1981
PDF: [Not available online]
Bibliographic Information:
Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7
Bibliographic Reference:
M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis. The Complexity of Testing Whether a Graph is a Superconcentrator. Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7, 1981