{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:04:26Z","timestamp":1649181866330},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0020-0190(91)90232-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"117-121","source":"Crossref","is-referenced-by-count":3,"title":["On matroids and hierarchial graphs"],"prefix":"10.1016","volume":"38","author":[{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"first","affiliation":[]},{"given":"Mark A.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90232-7_BIB1","first-page":"127","article-title":"The complexity of manipulating hierarchically defined sets of rectangles","volume":"1","author":"Bentley","year":"1983","journal-title":"Adv. in Comput. Res."},{"issue":"2","key":"10.1016\/0020-0190(91)90232-7_BIB2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"issue":"5","key":"10.1016\/0020-0190(91)90232-7_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(88)90089-0","article-title":"A linear-time algorithm for finding a minimum spanning pseudoforest","volume":"27","author":"Gabow","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90232-7_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","article-title":"Succinct representations of graphs","volume":"56","author":"Galperin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(91)90232-7_BIB5","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0020-0190(91)90232-7_BIB6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0196-6774(87)90042-3","article-title":"Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs","volume":"8","author":"Lengauer","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(91)90232-7_BIB7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BFb0039598","article-title":"The correlation between the complexities of the non-hierarchical and hierarchical versions of graph properties","volume":"247","author":"Lengauer","year":"1987","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0020-0190(91)90232-7_BIB8","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0217068","article-title":"Efficient solution of connectivity problems on hierarchically defined graphs","volume":"17","author":"Lengauer","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90232-7_BIB9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0095-8956(79)90018-2","article-title":"Infinite subgraphs as matroid circuits","volume":"27","author":"Matthews","year":"1979","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/0020-0190(91)90232-7_BIB10","series-title":"Progress in Combinatorial Optimization","article-title":"Some problems on dynamic\u29f8periodic graphs","author":"Orlin","year":"1984"},{"key":"10.1016\/0020-0190(91)90232-7_BIB11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(91)90232-7_BIB12","article-title":"Matroid Theory","volume":"8","author":"Welsh","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:06Z","timestamp":1555129446000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091902327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0020019091902327"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90232-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}