%0 Journal Article %1 journals/ipl/BlumKVPY81 %A Blum, Manuel %A Karp, Richard M. %A Vornberger, Oliver %A Papadimitriou, Christos H. %A Yannakakis, Mihalis %D 1981 %J Inf. Process. Lett. %K dblp %N 4/5 %P 164-167 %T The Complexity of Testing Whether a Graph is a Superconcentrator. %U http://dblp.uni-trier.de/db/journals/ipl/ipl13.html#BlumKVPY81 %V 13

@article{journals/ipl/BlumKVPY81, added-at = {2020-08-13T00:00:00.000+0200}, author = {Blum, Manuel and Karp, Richard M. and Vornberger, Oliver and Papadimitriou, Christos H. and Yannakakis, Mihalis}, biburl = {https://www.bibsonomy.org/bibtex/2aaeb62b4a3b902816da522daa09dd262/dblp}, ee = {https://www.wikidata.org/entity/Q97309514}, interhash = {9315084a177d55409afbdfb8c9d9d6f0}, intrahash = {aaeb62b4a3b902816da522daa09dd262}, journal = {Inf. Process. Lett.}, keywords = {dblp}, number = {4/5}, pages = {164-167}, timestamp = {2020-08-14T11:42:13.000+0200}, title = {The Complexity of Testing Whether a Graph is a Superconcentrator.}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl13.html#BlumKVPY81}, volume = 13, year = 1981 }