Skip to main content

1 Result(s)

within Geometry Remove this filter Dušan Knop Remove this filter Chapter Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    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 neighbor...

    Dušan Knop, Martin Koutecký, Tomáš Masařík… in Graph-Theoretic Concepts in Computer Scien… (2017)