{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T06:48:45Z","timestamp":1707806925742},"reference-count":11,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8898,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1982,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The problem considered is that of removing the maximum number of edges from a digraph without affecting its reachability properties. The worst\u2010case performance of algorithms from the related literature is analyzed; it is found that Hsu's method contains some mistakes. A new algorithm is presented, based on a reduction procedure and on a branch and bound search; its efficiency is studied both theoretically and through computational experiments.<\/jats:p>","DOI":"10.1002\/net.3230120202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T13:20:22Z","timestamp":1178889622000},"page":"89-100","source":"Crossref","is-referenced-by-count":12,"title":["Finding a minimum equivalent graph of a digraph"],"prefix":"10.1002","volume":"12","author":[{"given":"Silvano","family":"Martello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252839"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321864.321866"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02253052"},{"key":"e_1_2_1_6_2","unstructured":"S.Martello An enumerative algorithm for finding Hamiltonian circuits in a directed graph. Research Report Istituto di Automatica University of Bologna (1981)."},{"key":"e_1_2_1_7_2","unstructured":"S.MartelloandP.Toth Finding a minimal equivalent graph of a digraph. Presented at the TIMS\/ORSA Joint National Meeting New Orleans April\u2010May1979."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/321526.321534"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940892"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"S.Sahni Computationally related problems.SIAM J. Comput.3 (1974)262\u2013279.","DOI":"10.1137\/0203021"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"S.Warshall A theorem on Boolean matrices.J. ACM(1962)11\u201312.","DOI":"10.1145\/321105.321107"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230120202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230120202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:30:32Z","timestamp":1699795832000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230120202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["10.1002\/net.3230120202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230120202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}