Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity

Dušan Knop, Martin Koutecký, Tomáš Masařík, Tomáš Toufar

Open source

DOI
10.23638/lmcs-15(4:12)2019
Published
2019-12-04
Container
Logical Methods in Computer Science
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.23638/lmcs-15-4:12-2019,
  title = {Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity},
  author = {Dušan Knop and Martin Koutecký and Tomáš Masařík and Tomáš Toufar},
  year = {2019},
  journal = {Logical Methods in Computer Science},
  doi = {10.23638/lmcs-15(4:12)2019},
  url = {https://doi.org/10.23638/lmcs-15(4:12)2019}
}

RIS

TY  - JOUR
TI  - Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
AU  - Dušan Knop
AU  - Martin Koutecký
AU  - Tomáš Masařík
AU  - Tomáš Toufar
PY  - 2019
JO  - Logical Methods in Computer Science
DO  - 10.23638/lmcs-15(4:12)2019
UR  - https://doi.org/10.23638/lmcs-15(4:12)2019
ER  - 

APA

Knop, D., Koutecký, M., Masařík, T., & Toufar, T. (2019). Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Logical Methods in Computer Science. https://doi.org/10.23638/lmcs-15(4:12)2019

Source records