{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T05:00:50Z","timestamp":1775538050861,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0166-218x(92)90208-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"87-92","source":"Crossref","is-referenced-by-count":28,"title":["Narrowness, pathwidth, and their application in natural language processing"],"prefix":"10.1016","volume":"36","author":[{"given":"Andr\u00e1s","family":"Kornai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90208-R_BIB1","series-title":"Tech. Rep. TR-245","article-title":"On memory limitations in natural language processing","author":"Church","year":"1980"},{"key":"10.1016\/0166-218X(92)90208-R_BIB2","series-title":"Lecture at 4\u00e8me Colloque International en Th\u00e9orie des Graphes et Combinatoire","article-title":"La largeur d'un arbre","author":"Duchet","year":"1990"},{"key":"10.1016\/0166-218X(92)90208-R_BIB3","series-title":"Graph separation and search number","author":"Ellis","year":"1984"},{"key":"10.1016\/0166-218X(92)90208-R_BIB4","series-title":"The Psychology of Language","author":"Fodor","year":"1974"},{"key":"10.1016\/0166-218X(92)90208-R_BIB5","series-title":"Pattern matching","author":"K\u00e1lm\u00e1n","year":"1984"},{"key":"10.1016\/0166-218X(92)90208-R_BIB6","first-page":"657","article-title":"NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph","author":"Kashiwabara","year":"1979","journal-title":"Proceedings ISCAS"},{"key":"10.1016\/0166-218X(92)90208-R_BIB7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","article-title":"Interval graphs and searching","volume":"55","author":"Kirousis","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90208-R_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"Searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(92)90208-R_BIB9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","article-title":"Black-white pebbles and graph separation","volume":"16","author":"Lengauer","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(92)90208-R_BIB10","series-title":"Proceedings 10th ICALP","first-page":"478","article-title":"Minimizing width in linear layouts","volume":"154","author":"Makedon","year":"1983"},{"key":"10.1016\/0166-218X(92)90208-R_BIB11","series-title":"Syntax","author":"Matthews","year":"1981"},{"key":"10.1016\/0166-218X(92)90208-R_BIB12","series-title":"Dependency Syntax: Theory and Practice","author":"Mel'cuk","year":"1987"},{"key":"10.1016\/0166-218X(92)90208-R_BIB13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1037\/h0043158","article-title":"The magical number seven, plus or minus two: some limits on our capacity for processing information","volume":"63","author":"Miller","year":"1956","journal-title":"Psych. Rev."},{"key":"10.1016\/0166-218X(92)90208-R_BIB14","series-title":"Computational Graph Theory","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","volume":"7","author":"M\u00f6hring","year":"1990"},{"key":"10.1016\/0166-218X(92)90208-R_BIB15","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TCS.1979.1084695","article-title":"One-dimensional logic gate assignment and interval graphs","volume":"26","author":"Ohtsuki","year":"1979","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(92)90208-R_BIB16","series-title":"Proceedings 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing","first-page":"549","article-title":"The search number of a connected graph","author":"Parsons","year":"1978"},{"key":"10.1016\/0166-218X(92)90208-R_BIB17","doi-asserted-by":"crossref","first-page":"831","DOI":"10.2307\/412337","article-title":"The finiteness of natural language","volume":"45","author":"Reich","year":"1969","journal-title":"Language"},{"key":"10.1016\/0166-218X(92)90208-R_BIB18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors, I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(92)90208-R_BIB19","series-title":"Topics in Combinatorics and Graph Theory","first-page":"613","article-title":"A linear algorithm for the pathwidth of trees","author":"Scheffler","year":"1990"},{"key":"10.1016\/0166-218X(92)90208-R_BIB20","author":"Takashini","year":"1990","journal-title":"A characterization of the cycle-free k-path in terms of forbidden minors"},{"key":"10.1016\/0166-218X(92)90208-R_BIB21","series-title":"El\u00e9ments de Syntaxe Structurale","author":"Tesni\u00e8re","year":"1959"},{"key":"10.1016\/0166-218X(92)90208-R_BIB22","first-page":"238","article-title":"Symbols among the neurons: details of a connectionist inference architecture","author":"Touretzky","year":"1985","journal-title":"Proceedings 9th International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0166-218X(92)90208-R_BIB23","author":"Tuza","year":"1990","journal-title":"Problems related to pathwidth and narrowness"},{"key":"10.1016\/0166-218X(92)90208-R_BIB24","article-title":"Narrow graphs in natural language processing","author":"Tuza","year":"1984","journal-title":"Lecture at Csillag P\u00e1l Mathematical Colloquium"},{"key":"10.1016\/0166-218X(92)90208-R_BIB25","series-title":"The Structure of Language and its Mathematical Aspects","first-page":"130","article-title":"The depth hypothesis","author":"Yngve","year":"1961"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290208R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290208R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:40Z","timestamp":1555136560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290208R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0166218X9290208R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90208-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}