The Bounded Tree-Width Problem of Context-Free Graph Languages.

Konstantin Skodinis The Bounded Tree-Width Problem of Context-Free Graph Languages. 303-317 1997 conf/wg/1997 WG db/conf/wg/wg97.html#Skodinis97 http://dx.doi.org/10.1007/BFb0024506