{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:07:27Z","timestamp":1648526847740},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10759,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1016\/0166-218x(84)90068-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"209-220","source":"Crossref","is-referenced-by-count":6,"title":["Optimal constructions of reversible digraphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Maciej M.","family":"Sys\u0142o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(84)90068-4_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(84)90068-4_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02854581","article-title":"Some properties of line digraphs","volume":"9","author":"Harary","year":"1980","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"10.1016\/0166-218X(84)90068-4_BIB3","first-page":"257","article-title":"Characterizations and constructions of minimally 2-connected graphs and minimally strong digraphs","author":"Hedetniemi","year":"1970","journal-title":"Proc. 2nd, S.-E. Conf. Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0166-218X(84)90068-4_BIB4","series-title":"Selected Topics in Graph Theory","first-page":"271","article-title":"Line graphs and line digraphs","author":"Hemminger","year":"1978"},{"key":"10.1016\/0166-218X(84)90068-4_BIB5","first-page":"743","article-title":"Sur une certaine correspondance entre graphs","volume":"3","author":"Huchenne","year":"1964","journal-title":"Bull. Soc. Roy. Soc. Li\u00e9ge"},{"key":"10.1016\/0166-218X(84)90068-4_BIB6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/net.3230090302","article-title":"Complexity of the minimum-dummy-activities problem in a PERT network","volume":"9","author":"Krishnamoorthy","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0166-218X(84)90068-4_BIB7","first-page":"5","article-title":"Remarks on line digraphs","volume":"22","author":"Sys\u0142o","year":"1974","journal-title":"Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys."},{"key":"10.1016\/0166-218X(84)90068-4_BIB8","first-page":"241","article-title":"Optimal constructions of event-node networks","volume":"15","author":"Sys\u0142o","year":"1981","journal-title":"R.A.I.R.O. Recherche Op\u00e9rationnelle"},{"key":"10.1016\/0166-218X(84)90068-4_BIB9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0020-0190(82)90080-1","article-title":"A labeling algorithm to recognize a line digraph and output its root graph","volume":"15","author":"Sys\u0142o","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(84)90068-4_BIB10","first-page":"3","article-title":"On foundations of network planning (in Polish)","volume":"4","author":"Szamko\u0142owicz","year":"1972"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900684?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900684?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:43Z","timestamp":1555122403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84900684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["0166218X84900684"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90068-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}