Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical theorem of Courcelle states that any graph property defina...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Logical Methods in Computer Science e.V.
2019-12-01
|
| Seri Bilgileri: | Logical Methods in Computer Science |
| Konular: | |
| Online Erişim: | https://lmcs.episciences.org/5017/pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|