BibTeX record journals/ipl/BlumKVPY81

download as .bib file

@article{DBLP:journals/ipl/BlumKVPY81,
  author       = {Manuel Blum and
                  Richard M. Karp and
                  Oliver Vornberger and
                  Christos H. Papadimitriou and
                  Mihalis Yannakakis},
  title        = {The Complexity of Testing Whether a Graph is a Superconcentrator},
  journal      = {Inf. Process. Lett.},
  volume       = {13},
  number       = {4/5},
  pages        = {164--167},
  year         = {1981},
  url          = {https://doi.org/10.1016/0020-0190(81)90050-8},
  doi          = {10.1016/0020-0190(81)90050-8},
  timestamp    = {Thu, 13 Aug 2020 18:46:14 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BlumKVPY81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.