{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:45Z","timestamp":1725663285158},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528463"},{"type":"electronic","value":"9783540471646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52846-6_101","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:43:50Z","timestamp":1330206230000},"page":"320-331","source":"Crossref","is-referenced-by-count":0,"title":["On matroids and hierarchical graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"first","affiliation":[]},{"given":"Mark A.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"29_CR1","first-page":"333","volume-title":"Advanced Techniques in the Practice of Operations Research","author":"R. E. Bixby","year":"1982","unstructured":"R. E. Bixby, Matroids and operations research, Advanced Techniques in the Practice of Operations Research (H. Greenburg, F. Murphy, S. Shaw, eds.), North-Holland, New York, 1982, 333\u2013458."},{"key":"29_CR2","first-page":"127","volume":"1","author":"J. L. Bentley","year":"1983","unstructured":"J. L. Bentley, T. Ottmann and P. Widmayer, The complexity of manipulating hierarchically defined sets of rectangles, Advances in Computing Research, 1 (1983), 127\u2013158.","journal-title":"Advances in Computing Research"},{"key":"29_CR3","volume-title":"A discipline of programming","author":"E. W. Dijkstra","year":"1976","unstructured":"E. W. Dijkstra, A discipline of programming, Prentice Hall, Englewood Cliffs, N.J., 1976."},{"key":"29_CR4","unstructured":"D. Fernandez-Baca and M. Williams, Augmentation Problems on Hierarchically Defined Graphs, TR#89-8, Dept. of Computer Science, Iowa State Univ., August, 1989. (A preliminary version appeared in the Proceedings of WADS 89 (F. Dehne, J.-R. Sack, N. Santoro, eds.), Springer LNCS No. 382 (1989), 563\u2013576.)"},{"issue":"2","key":"29_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H. N. Gabow","year":"1986","unstructured":"H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica, 6(2) (1986), 109\u2013122.","journal-title":"Combinatorica"},{"issue":"5","key":"29_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(88)90089-0","volume":"27","author":"H. N. Gabow","year":"1988","unstructured":"H. N. Gabow and R. E. Tarjan, A linear-time algorithm for finding a minimum spanning pseudoforest, Information Processing Letters, 27(5) (1988), 259\u2013263.","journal-title":"Information Processing Letters"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"H. Galperin and A. Widgerson, Succinct representations of graphs, Information and Control, 56 (1983), 183\u2013198.","journal-title":"Information and Control"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"K. Iwano and K. Steiglitz, Testing for Cycles in Infinite Graphs with Periodic Structure, Proceedings of 19th ACM STOC, 1987, 46\u201355.","DOI":"10.1145\/28395.28401"},{"key":"29_CR9","volume-title":"Combinatorial optimization: networks and matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler, Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, New York, 1976."},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0196-6774(87)90042-3","volume":"8","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer, Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs, J. Algorithms, 8 (1987), 260\u2013284.","journal-title":"J. Algorithms"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"T. Lengauer and K. Wagner, The correlation between the complexities of the non-hierarchical and hierarchical versions of graph properties, Proceedings of STACS 87 (F.J. Brandenburg et al. eds.), Springer LNCS No. 247 (1987), 100\u2013113.","DOI":"10.1007\/BFb0039598"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0217068","volume":"17","author":"T. Lengauer","year":"1989","unstructured":"T. Lengauer and E. Wanke, Efficient solution of connectivity problems on hierarchically defined graphs, SIAM Journal on Computing, 17 (1989), 1063\u20131080.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"T. Lengauer and E. Wanke, Efficient analysis of graph properties on context-free graph languages, Proceedings of ICALP 88 (T. Lepist\u00f6 and A. Salomaa, eds.), Springer LNCS No. 317 (1988), 379\u2013393.","DOI":"10.1007\/3-540-19488-6_129"},{"issue":"2","key":"29_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1093\/qmath\/28.2.213","volume":"28","author":"L. R. Matthews","year":"1977","unstructured":"L. R. Matthews, Bicircular Matroids, Quart. J. Math. Oxford (2), 28 (1977), 213\u2013228.","journal-title":"Quart. J. Math. Oxford"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0095-8956(79)90018-2","volume":"27","author":"L. R. Matthews","year":"1979","unstructured":"L. R. Matthews, Infinite subgraphs as matroid circuits, Journal of Combinatorial Theory, Series B, 27 (1979), 260\u2013273.","journal-title":"Journal of Combinatorial Theory"},{"key":"29_CR16","volume-title":"Some problems on dynamic\/periodic graphs","author":"J. B. Orlin","year":"1984","unstructured":"J. B. Orlin, Some problems on dynamic\/periodic graphs, Progress in Combinatorial Optimization, Academic Press Canada, Toronto, 1984."},{"key":"29_CR17","volume-title":"Combinatorial optimization \u2014 algorithms and complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization \u2014 algorithms and complexity, Prentice Hall, Englewood Cliffs, N.J., 1982."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C. Papadimitriou","year":"1986","unstructured":"C. Papadimitriou and M. Yannakakis, A note on succinct representation of graphs, Information and Control, 71 (1986), 181\u2013185.","journal-title":"Information and Control"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01111390","volume":"127","author":"J. M. S. Sim\u00f5es Pereira","year":"1972","unstructured":"J. M. S. Sim\u00f5es Pereira, On subgraphs as matroid cells, Math. Z., 127 (1972), 315\u2013322.","journal-title":"Math. Z."},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal on Computing, 1 (1972), 146\u2013160.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00289117","volume":"23","author":"K. W. Wagner","year":"1986","unstructured":"K. W. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Informatica, 23 (1986), 325\u2013356.","journal-title":"Acta Informatica"},{"key":"29_CR22","series-title":"London Math. Soc. Monographs","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh, Matroid Theory, London Math. Soc. Monographs, Vol. 8, Academic Press, New York\/London, 1976."},{"key":"29_CR23","unstructured":"N. L. White and W. Whiteley, A class of matroids defined on graphs and hypergraphs by counting properties, Manuscript."},{"key":"29_CR24","volume-title":"Introduction to Graph Theory","author":"R. J. Wilson","year":"1979","unstructured":"R. J. Wilson, Introduction to Graph Theory, Academic Press, New York, 1979."}],"container-title":["Lecture Notes in Computer Science","SWAT 90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52846-6_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:28Z","timestamp":1619572168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52846-6_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528463","9783540471646"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-52846-6_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}