{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:55:07Z","timestamp":1674568507950},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":7837,"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":[[1992,2]]},"DOI":"10.1016\/0022-0000(92)90004-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"63-93","source":"Crossref","is-referenced-by-count":35,"title":["The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems"],"prefix":"10.1016","volume":"44","author":[{"given":"T.","family":"Lengauer","sequence":"first","affiliation":[]},{"given":"K.W.","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90004-3_BIB1_1","article-title":"Alternation","author":"Chandra","year":"1978"},{"key":"10.1016\/0022-0000(92)90004-3_BIB1_2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90004-3_BIB2","article-title":"On Linear Area Embedding of Planar Graphs","author":"Dolev","year":"1981"},{"key":"10.1016\/0022-0000(92)90004-3_BIB3","article-title":"Succinct Representations of Graphs","author":"Galperin","year":"1982"},{"key":"10.1016\/0022-0000(92)90004-3_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90004-3_BIB5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar circuit value problems are log-space complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(92)90004-3_BIB6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","article-title":"The maximum flow problem is logspace complete for P","volume":"21","author":"Goldschlager","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90004-3_BIB7","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. Control"},{"key":"10.1016\/0022-0000(92)90004-3_BIB8_1","series-title":"20th IEFE-FOCS","first-page":"337","article-title":"Length of predicate calculus formulas as a new complexity measure","author":"Immerman","year":"1979"},{"key":"10.1016\/0022-0000(92)90004-3_BIB8_2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90004-3_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibilities among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(92)90004-3_BIB10","series-title":"Proceedings, 17th ACM STOC","first-page":"22","article-title":"Constructing a perfect matching is In 32 random NC","author":"Karp","year":"1985"},{"key":"10.1016\/0022-0000(92)90004-3_BIB11","series-title":"23rd IEEE-FOCS","first-page":"358","article-title":"The complexity of compacting hierarchically specified layouts of integrated circuits","author":"Lengauer","year":"1982"},{"key":"10.1016\/0022-0000(92)90004-3_BIB12","doi-asserted-by":"crossref","unstructured":"T. Lengauer, Exploiting hierarchy in VLSI design, in \u201cVLSI Algorithms and Architectures\u201d (F. Makedon et al., Eds), Springer Lecture Notes in Computer Science, Vol. 227, pp. 180\u2013193.","DOI":"10.1007\/3-540-16766-8_16"},{"key":"10.1016\/0022-0000(92)90004-3_BIB13","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\/0022-0000(92)90004-3_BIB14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02310101","article-title":"Efficient solutions of hierarchical systems of linear equations","volume":"39","author":"Lengauer","year":"1987","journal-title":"Computing"},{"issue":"No 6","key":"10.1016\/0022-0000(92)90004-3_BIB15","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0217068","article-title":"Efficient solutions of connectivity problems on hierarchically defined graphs","volume":"17","author":"Lengauer","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90004-3_BIB16","series-title":"Proceedings of ICALP 88","first-page":"379","article-title":"The efficient analysis of graph properties on languages generated by hyperedge replacement systems","volume":"Vol. 317","author":"Lengauer","year":"1988"},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90004-3_BIB17","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1145\/65950.65952","article-title":"Hierarchical planarity testing algorithms","volume":"36","author":"Lengauer","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90004-3_BIB18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0304-3975(90)90101-M","article-title":"The binary network flow problem in logspace complete for P","volume":"75","author":"Lengauer","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90004-3_BIB19","series-title":"13th IEEE-SWAT","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/0022-0000(92)90004-3_BIB20","series-title":"Proceedings, MFCS 81","first-page":"78","article-title":"Time and space bounded complexity classes and bandwidth constrained problems","volume":"Vol. 118","author":"Monien","year":"1981"},{"key":"10.1016\/0022-0000(92)90004-3_BIB21","series-title":"An Introduction to General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0022-0000(92)90004-3_BIB22","doi-asserted-by":"crossref","unstructured":"C. H. PAPADIMITRIOU AND M. YANNAKAKIS, A note on succinct representation of graphs, Inform. Control, to appear.","DOI":"10.1016\/S0019-9958(86)80009-2"},{"key":"10.1016\/0022-0000(92)90004-3_BIB23","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0022-0000(73)80031-5","article-title":"Maze recognizing automata and nondeterministic tape complexity","volume":"7","author":"Savitch","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90004-3_BIB24","series-title":"5th ACM-STOC","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/0022-0000(92)90004-3_BIB25","series-title":"14th IEEE-SWAT","first-page":"138","article-title":"On tape-bounded complexity classes and multihead finite automata","author":"Sudborough","year":"1973"},{"key":"10.1016\/0022-0000(92)90004-3_BIB26","series-title":"Proceedings 21st IEEE-FOCS","first-page":"62","article-title":"Efficient algorithms for path system problems and application to alternating and time-space complexity classes","author":"Sudborough","year":"1980"},{"key":"10.1016\/0022-0000(92)90004-3_BIB27","series-title":"Proceedings, 22nd IEEE-FOCS","first-page":"244","article-title":"A complexity theory based on Boolean algebra","author":"Skyum","year":"1981"},{"key":"10.1016\/0022-0000(92)90004-3_BIB28","series-title":"Proceedings, MFCS 84","first-page":"544","article-title":"The complexity of problems concerning graphs with regularities","volume":"Vol. 176","author":"Wagner","year":"1984"},{"key":"10.1016\/0022-0000(92)90004-3_BIB29","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."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:51Z","timestamp":1550307411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000092900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["0022000092900043"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90004-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}