π
π
The Cartographer
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
February 25, 2022 Β· Declared Dead Β· π Logic in Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Γdouard Bonnet, Jan Dreier, Jakub GajarskΓ½, Stephan Kreutzer, Nikolas MΓ€hlmann, Pierre Simon, Szymon ToruΕczyk
arXiv ID
2202.13014
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM,
cs.LO,
math.CO
Citations
16
Venue
Logic in Computer Science
Last Checked
3 months ago
Abstract
We present a fixed-parameter tractable algorithm for first-order model checking on interpretations of graph classes with bounded local cliquewidth. Notably, this includes interpretations of planar graphs, and more generally, of classes of bounded genus. To obtain this result we develop a new tool which works in a very general setting of dependent classes and which we believe can be an important ingredient in achieving similar results in the future.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted