{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:45:32Z","timestamp":1760597132379},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0022-0000(79)90053-9","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"76-85","source":"Crossref","is-referenced-by-count":35,"title":["Linear algorithms on recursive representations of trees"],"prefix":"10.1016","volume":"18","author":[{"given":"S.L.","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.J.","family":"Cockayne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90053-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(79)90053-9_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/0022-0000(79)90053-9_BIB3","unstructured":"E. J. Cockayne, B. L. Hartnell, and S. T. Hedetniemi, A linear algorithm for disjoint matchings in trees, submitted."},{"key":"10.1016\/0022-0000(79)90053-9_BIB4","series-title":"Proc. Seventh Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica","first-page":"273","article-title":"The bandwidth of a graph-Some recent results","author":"Dewdney","year":"1976"},{"key":"10.1016\/0022-0000(79)90053-9_BIB5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(79)90053-9_BIB6","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0205009","article-title":"B-matchings in trees","volume":"5","author":"Goodman","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(79)90053-9_BIB7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1145\/362248.362272","article-title":"Efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(79)90053-9_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/net.3230030107","article-title":"Recursive analysis of network realiability","volume":"3","author":"Kershenbaum","year":"1973","journal-title":"Networks"},{"key":"10.1016\/0022-0000(79)90053-9_BIB9","series-title":"Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0022-0000(79)90053-9_BIB10","first-page":"116","article-title":"Graphen and Matrizen","volume":"38","author":"Konig","year":"1931","journal-title":"Mat. Fix. Lapok"},{"key":"10.1016\/0022-0000(79)90053-9_BIB11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0025-5564(74)90013-3","article-title":"Cutting down recursive trees","volume":"21","author":"Meir","year":"1974","journal-title":"Math. Biosci."},{"key":"10.1016\/0022-0000(79)90053-9_BIB12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0020-0190(75)90057-5","article-title":"Optimal chain partitions of trees","volume":"4","author":"Mirsha","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/0022-0000(79)90053-9_BIB13","article-title":"Algorithms on Trees and Maximal Outerplanar Graphs: Design, Complexity Analysis and Data Structures Study","author":"Mitchell","year":"1977"},{"key":"10.1016\/0022-0000(79)90053-9_BIB14","series-title":"Proc. Sixth Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica","first-page":"467","article-title":"Some linear algorithms on trees","author":"Mitchell","year":"1975"},{"key":"10.1016\/0022-0000(79)90053-9_BIB15","unstructured":"S. L. Mitchell and S. T. Hedetniemi, Edge domination in trees, in \u201cProc. Eighth Southeastern Conf. on Combinatorics, Graph Theory and Computing,\u201d in press."},{"key":"10.1016\/0022-0000(79)90053-9_BIB16","series-title":"Proc. of the British Combinatorial Conf.","first-page":"125","article-title":"The distance between nodes in recursive trees","author":"Moon","year":"1974"},{"key":"10.1016\/0022-0000(79)90053-9_BIB17","first-page":"381","article-title":"The codifying of tree structure","volume":"49","author":"Neville","year":"1953"},{"key":"10.1016\/0022-0000(79)90053-9_BIB18","first-page":"122","article-title":"Neur Beweis Eines Satzes Uber Permutationen","volume":"27","author":"Prufer","year":"1918","journal-title":"Arch. Math. Phys."},{"key":"10.1016\/0022-0000(79)90053-9_BIB19","series-title":"Graph Theory and Computing","first-page":"153","article-title":"The coding of various kinds of unlabeled trees","author":"Read","year":"1972"},{"key":"10.1016\/0022-0000(79)90053-9_BIB20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On simple characterizations of k-trees","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0022-0000(79)90053-9_BIB21","series-title":"Proc. Fourth Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica","first-page":"479","article-title":"Labelling of balanced trees","author":"Stanton","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900539?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900539?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:31Z","timestamp":1550319631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0022000079900539"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90053-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}