{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:07:02Z","timestamp":1777540022461,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,9,12]],"date-time":"2001-09-12T00:00:00Z","timestamp":1000252800000},"content-version":"vor","delay-in-days":1868,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0166-218x(95)00105-z","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"281-289","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["On strongly connected digraphs with bounded cycle length"],"prefix":"10.1016","volume":"69","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00105-Z_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00105-Z_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(95)00105-Z_BIB3","series-title":"Computers and Intractability: A guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(95)00105-Z_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00105-Z_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321864.321866","article-title":"An algorithm for finding a minimal equivalent graph of a digraph","volume":"22","author":"Hsu","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)00105-Z_BIB6","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/S0097539793256685","article-title":"Approximating the minimum equivalent digraph","volume":"24","author":"Khuller","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00105-Z_BIB7","series-title":"Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0166-218X(95)00105-Z_BIB8","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/321526.321534","article-title":"An algorithm for finding the minimum equivalent graph of a digraph","volume":"16","author":"Moyles","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)00105-Z_BIB9","first-page":"315","article-title":"An algorithm for a minimum cover of a graph","volume":"10","author":"Norman","year":"1959"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500105Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500105Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:53:02Z","timestamp":1757451182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500105Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0166218X9500105Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00105-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On strongly connected digraphs with bounded cycle length","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(95)00105-Z","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}