{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:20:53Z","timestamp":1726518053370},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"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":[[1994,8]]},"DOI":"10.1016\/s0022-0000(05)80086-8","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"57-82","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of connectivity problems on context-free graph languages"],"prefix":"10.1016","volume":"49","author":[{"given":"Egon","family":"Wanke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80086-8_bib1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80086-8_bib2","article-title":"Proceedings of Graph-Grammars and Their Application to Computer Science '78","volume":"Vol. 73","author":"Claus","year":"1979"},{"key":"10.1016\/S0022-0000(05)80086-8_bib3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","article-title":"An axiomatic definition of context-free rewriting and its application to NLC graph grammars","volume":"55","author":"Courcelle","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80086-8_bib4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80086-8_bib5","series-title":"Proceedings of Graph-Grammars and Their Application to Computer Science '86","first-page":"167","article-title":"Apex graph grammars","volume":"Vol. 291","author":"Engelfriet","year":"1987"},{"key":"10.1016\/S0022-0000(05)80086-8_bib6","series-title":"Proceedings of Graph-Grammars and Their Application to Computer Science '82","volume":"Vol. 153","author":"Ehrig","year":"1983"},{"key":"10.1016\/S0022-0000(05)80086-8_bib7","series-title":"Proceedings, of Graph-Grammars and Their Application to Computer Science '86","volume":"Vol. 291","author":"Ehrig","year":"1987"},{"key":"10.1016\/S0022-0000(05)80086-8_bib8","series-title":"Proceedings of Graph-Grammars and Their Application to Computer Science '90","volume":"Vol. 532","author":"Ehrig","year":"1991"},{"year":"1979","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0022-0000(05)80086-8_bib9"},{"key":"10.1016\/S0022-0000(05)80086-8_bib10","article-title":"Hyperedge Replacement: Grammars and Languages","volume":"Vol. 643","author":"Habel","year":"1992"},{"key":"10.1016\/S0022-0000(05)80086-8_bib11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(90)90106-R","article-title":"Decidable boundedness problems for hyperedge-replacement graph grammars","volume":"89","author":"Habel","year":"1991","journal-title":"Theor. Comput. Science"},{"key":"10.1016\/S0022-0000(05)80086-8_bib12","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/BF00288976","article-title":"Metatheorems for decision problems on hyperedge replacement graph languages","volume":"26","author":"Habel","year":"1989","journal-title":"Acta Inform."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/S0022-0000(05)80086-8_bib13"},{"key":"10.1016\/S0022-0000(05)80086-8_bib14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","article-title":"On the structure of node label controlled graph languages","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/S0022-0000(05)80086-8_bib15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","article-title":"Restrictions, extensions, and variations of NLC grammars","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"issue":"2","key":"10.1016\/S0022-0000(05)80086-8_bib16","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1145\/151261.151268","article-title":"Efficient analysis of graph properties on context-free graph languages","volume":"40","author":"Lengauer","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 6","key":"10.1016\/S0022-0000(05)80086-8_bib17","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":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80086-8_bib18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(92)90004-3","article-title":"The correlation between the complexities of the non-hierarchical and hierarcnical version of graph problems","volume":"44","author":"Lengauer","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80086-8_bib19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","article-title":"Graph theoretic closure properties of the family of boundary NLC graph languages","volume":"23","author":"Rozenberg","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(05)80086-8_bib20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(87)90054-0","article-title":"Combinatorial properties of boundary NLC graph languages","volume":"16","author":"Rozenberg","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0022-0000(05)80086-8_bib21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"article-title":"Algorithmen und Komplexit\u00e4tsanalyse f\u00fcr die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien","year":"1989","author":"Wanke","key":"10.1016\/S0022-0000(05)80086-8_bib22"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80086-8_bib23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(91)90035-Z","article-title":"Algorithms for graph problems on BNLC structured graphs","volume":"94","author":"Wanke","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80086-8_bib24","article-title":"On the decidability of certain integer subgraph problems on context-free graph languages","volume":"108","author":"Wanke","year":"1994","journal-title":"Inform. and Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800868?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800868?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:27Z","timestamp":1548196047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["S0022000005800868"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80086-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}