%0 Conference Paper %1 conf/wg/MontejanoS15 %A Montejano, Luis Pedro %A Sau, Ignasi %B WG %D 2015 %E Mayr, Ernst W. %I Springer %K dblp %P 219-233 %T On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. %U http://dblp.uni-trier.de/db/conf/wg/wg2015.html#MontejanoS15 %V 9224 %@ 978-3-662-53173-0

@inproceedings{conf/wg/MontejanoS15, added-at = {2022-07-29T00:00:00.000+0200}, author = {Montejano, Luis Pedro and Sau, Ignasi}, biburl = {https://www.bibsonomy.org/bibtex/2951ee0464d65015fdd84be01cd1cae67/dblp}, booktitle = {WG}, crossref = {conf/wg/2015}, editor = {Mayr, Ernst W.}, ee = {https://doi.org/10.1007/978-3-662-53174-7_16}, interhash = {dc4638ff0eff848c2c2b193ac70ad487}, intrahash = {951ee0464d65015fdd84be01cd1cae67}, isbn = {978-3-662-53173-0}, keywords = {dblp}, pages = {219-233}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T22:10:08.000+0200}, title = {On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.}, url = {http://dblp.uni-trier.de/db/conf/wg/wg2015.html#MontejanoS15}, volume = 9224, year = 2015 }