Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/soda/Gabow03
@inproceedings{DBLP:conf/soda/Gabow03, author = {Harold N. Gabow}, title = {Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {460--469}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644184}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/Gabow03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.