BibTeX record conf/stoc/Gabow91

download as .bib file

@inproceedings{DBLP:conf/stoc/Gabow91,
  author       = {Harold N. Gabow},
  editor       = {Cris Koutsougeras and
                  Jeffrey Scott Vitter},
  title        = {A Matroid Approach to Finding Edge Connectivity and Packing Arborescences},
  booktitle    = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
                  May 5-8, 1991, New Orleans, Louisiana, {USA}},
  pages        = {112--122},
  publisher    = {{ACM}},
  year         = {1991},
  url          = {https://doi.org/10.1145/103418.103436},
  doi          = {10.1145/103418.103436},
  timestamp    = {Tue, 06 Nov 2018 11:07:06 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Gabow91.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.