Narrowness, pathwidth, and their application in natural language processing
- 30 March 1992
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 36 (1) , 87-92
- https://doi.org/10.1016/0166-218x(92)90208-r
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Searching and pebblingTheoretical Computer Science, 1986
- Interval graphs and seatchingDiscrete Mathematics, 1985
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Black-white pebbles and graph separationActa Informatica, 1981
- One-dimensional logic gate assignment and interval graphsIEEE Transactions on Circuits and Systems, 1979
- The Finiteness of Natural LanguageLanguage, 1969