The complexity of testing whether a graph is a superconcentrator
- 1 January 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (4-5) , 164-167
- https://doi.org/10.1016/0020-0190(81)90050-8
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- SuperconcentratorsSIAM Journal on Computing, 1977
- On non-linear lower bounds in computational complexityPublished by Association for Computing Machinery (ACM) ,1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935