BibTeX record conf/wg/MontejanoS15

download as .bib file

@inproceedings{DBLP:conf/wg/MontejanoS15,
  author       = {Luis Pedro Montejano and
                  Ignasi Sau},
  editor       = {Ernst W. Mayr},
  title        = {On the Complexity of Computing the k-restricted Edge-connectivity
                  of a Graph},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {219--233},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_16},
  doi          = {10.1007/978-3-662-53174-7\_16},
  timestamp    = {Fri, 29 Jul 2022 09:29:28 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/MontejanoS15.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.