π
π
The Cartographer
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
May 11, 2018 Β· Declared Dead Β· π Theory of Computing Systems
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
arXiv ID
1805.04375
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC
Citations
15
Venue
Theory of Computing Systems
Last Checked
3 months ago
Abstract
We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some property definable in first-order logic. We establish a number of sufficient and necessary conditions on the quantification pattern of the first-order formula Οfor the problem to be fixed-parameter tractable or to admit a polynomial kernel.
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