%0 Conference Paper %1 conf/soda/OrlinS17 %A Orlin, James B. %A Sedeño-Noda, Antonio %B SODA %D 2017 %E Klein, Philip N. %I SIAM %K dblp %P 1866-1879 %T An O(nm) time algorithm for finding the min length directed cycle in a graph. %U http://dblp.uni-trier.de/db/conf/soda/soda2017.html#OrlinS17 %@ 978-1-61197-478-2

@inproceedings{conf/soda/OrlinS17, added-at = {2021-02-02T00:00:00.000+0100}, author = {Orlin, James B. and Sedeño-Noda, Antonio}, biburl = {https://www.bibsonomy.org/bibtex/2174a242b179cece60f3c91394d4beae9/dblp}, booktitle = {SODA}, crossref = {conf/soda/2017}, editor = {Klein, Philip N.}, ee = {http://dl.acm.org/citation.cfm?id=3039808}, interhash = {535c26ef4924d0e38cb5e05bc48966ce}, intrahash = {174a242b179cece60f3c91394d4beae9}, isbn = {978-1-61197-478-2}, keywords = {dblp}, pages = {1866-1879}, publisher = {SIAM}, timestamp = {2024-04-09T11:20:43.000+0200}, title = {An O(nm) time algorithm for finding the min length directed cycle in a graph.}, url = {http://dblp.uni-trier.de/db/conf/soda/soda2017.html#OrlinS17}, year = 2017 }