Fingerprint
Dive into the research topics of 'Recognizability equals definability for graphs of bounded treewidth and bounded chordality'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Recognizability equals definability for graphs of bounded treewidth and bounded chordality
H.L. Bodlaender, P. Heggernes, J.A. Telle
Research output: Contribution to journal › Article › Academic › peer-review
4
Citations
(Scopus)
110
Downloads
(Pure)