Daniel Král' (Charles University, Czech Republic) Testing first order logic properties in sparse combinatorial structures Abstract: Algorithmic metatheorems guarantee that certain types of problems have efficient algorithms. A classical example is the theorem of Courcelle asserting that every monadic second-order logic (MSOL) property can be tested in linear time for graphs with bounded tree-width. As examples of MSOL properties let us mention 3-colorability, hamiltonicity, etc., all well-known NP-hard problems. In this talk, we focus on simpler properties, those that can be expressed in first order logic (FOL). An example of FOL property is an existence of a fixed substructure. While it is not hard to show that every FOL property can be decided in polynomial time, our desire is to design algorithms with faster running time (e.g. linear time). We recall a recent notion of graph classes with bounded expansion, which include classes of graphs with bounded maximum degree and proper-minor closed classes of graphs. We then apply structural results to show that FOL properties can be tested in linear time for classes of graphs with bounded expansion and we will discuss extensions to other structures. At the end of the talk, we will mention several open problems as well as directions for future research. This talk is based on joint work with Zdenek Dvorák and Robin Thomas. |
|