Narrowness, pathwidth, and their application in natural language processing

1992/03/01 by András Kornai, Zsolt Tuza · 1 citation
Computer Science · Mathematics · #Algorithms and Data Compression #Arithmetic #Computer science #Discrete mathematics #Graph #Mathematics #Natural Language Processing Techniques #Pathwidth #Programming language #semigroups and automata theory

paper · doi:10.1016/0166-218x(92)90208-r

crossref issued 1992/03/01 · crossref published 1992/03/01 · crossref published-print 1992/03/01 · openalex publication_date 1992/03/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/04/07 · openalex updated_date 2026/07/02

Citations

• Searching and pebbling
• Graph minors. I. Excluding a forest
• Black-white pebbles and graph separation
• One-dimensional logic gate assignment and interval graphs
• The magical number seven, plus or minus two: Some limits on our capacity for processing information.

Cited by

• Pathwidth [wikipedia]