{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:53:02Z","timestamp":1699797182259},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1007\/bf02253052","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:21:59Z","timestamp":1132071719000},"page":"183-194","source":"Crossref","is-referenced-by-count":6,"title":["An algorithm for finding a minimal equivalent graph of a strongly connected digraph"],"prefix":"10.1007","volume":"21","author":[{"given":"S.","family":"Martello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02253052_CR1","doi-asserted-by":"crossref","unstructured":"Hsu, H. T.: An Algorithm for Finding a Minimal Equivalent Graph of a Digraph. Journal of ACM22 (1975).","DOI":"10.1145\/321864.321866"},{"key":"BF02253052_CR2","doi-asserted-by":"crossref","unstructured":"Moyles, D. M., Thompson, G. L.: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph. Journal of ACM16 (1969).","DOI":"10.1145\/321526.321534"},{"key":"BF02253052_CR3","doi-asserted-by":"crossref","unstructured":"Yen, J. Y.: Finding the Lengths of all Shortest Paths inN-Node Nonnegative Distance Complete Networks Using 1\/2N 3 Additions andN 3 Comparisons. Journal of ACM19 (1972).","DOI":"10.1145\/321707.321712"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253052.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253052\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:37:09Z","timestamp":1586561829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["BF02253052"],"URL":"https:\/\/doi.org\/10.1007\/bf02253052","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}