Reducing CMSO Model Checking to Highly Connected Graphs

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi. Reducing CMSO Model Checking to Highly Connected Graphs. In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella, editors, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Volume 107 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.