%0 Journal Article %1 journals/computing/Martello79 %A Martello, Silvano %D 1979 %J Computing %K dblp %N 3 %P 183-194 %T An algorithm for finding a minimal equivalent graph of a strongly connected digraph. %U http://dblp.uni-trier.de/db/journals/computing/computing21.html#Martello79 %V 21

@article{journals/computing/Martello79, added-at = {2020-08-06T00:00:00.000+0200}, author = {Martello, Silvano}, biburl = {https://www.bibsonomy.org/bibtex/2173d386e22720e5be4415a9167ec543c/dblp}, ee = {https://doi.org/10.1007/BF02253052}, interhash = {36436ef5c33d740fa6a3bc26994a87ae}, intrahash = {173d386e22720e5be4415a9167ec543c}, journal = {Computing}, keywords = {dblp}, number = 3, pages = {183-194}, timestamp = {2020-08-07T11:49:11.000+0200}, title = {An algorithm for finding a minimal equivalent graph of a strongly connected digraph.}, url = {http://dblp.uni-trier.de/db/journals/computing/computing21.html#Martello79}, volume = 21, year = 1979 }