{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:29:20Z","timestamp":1648870160697},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1016\/0196-6774(86)90041-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"120-133","source":"Crossref","is-referenced-by-count":2,"title":["An algorithmic characterization of total digraphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Miros\u0142awa","family":"Skowro\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej M","family":"Sys\u0142o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina","family":"Zamfirescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(86)90041-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(86)90041-6_BIB2","first-page":"35","article-title":"On characterizations of the middle graphs","volume":"11","author":"Akiyama","year":"1975","journal-title":"TRU Math."},{"key":"10.1016\/0196-6774(86)90041-6_BIB3","article-title":"On Total Graphs","author":"Behzad","year":"1966"},{"key":"10.1016\/0196-6774(86)90041-6_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(82)90147-9","article-title":"Connection digraphs and second-order line digraphs","volume":"39","author":"Beineke","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(86)90041-6_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.4153\/CMB-1966-021-x","article-title":"Total digraphs","volume":"9","author":"Chartrand","year":"1966","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0196-6774(86)90041-6_BIB6","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","article-title":"On the asymptotic complexity of matrix multiplication","volume":"11","author":"Coppersmith","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(86)90041-6_BIB7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/net.3230080205","article-title":"A recognition algorithm for the total graphs","volume":"8","author":"Gavril","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0196-6774(86)90041-6_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(86)90041-6_BIB9","series-title":"Structural Models\u2014An Introduction to the Theory of Directed Graphs","author":"Harary","year":"1965"},{"key":"10.1016\/0196-6774(86)90041-6_BIB10","series-title":"Characterizations of Middle Digraphs of Multi- and General Digrpphs","author":"Skowro\u0144ska","year":"1981"},{"key":"10.1016\/0196-6774(86)90041-6_BIB11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(84)90067-2","article-title":"An algorithm to recognize a middle graph","volume":"7","author":"Skowro\u0144ska","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(86)90041-6_BIB12","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\/0196-6774(86)90041-6_BIB13","article-title":"Lokale und globale Untersuchungen der Line-, Middle und Total- Diagraphen","author":"Zamfirescu","year":"1977"},{"key":"10.1016\/0196-6774(86)90041-6_BIB14","series-title":"The Theory and Applications of Graphs","first-page":"507","article-title":"Local and global characterizations of middle digraphs","author":"Zamfirescu","year":"1981"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900416?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900416?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:25:46Z","timestamp":1548743146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677486900416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0196677486900416"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(86)90041-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}