Results 131 to 139 of about 1,490 (139)
Distributed Model Checking on Graphs of Bounded Treedepth
AlgorithmicaAbstract We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the model. To our knowledge, this marks the first meta-theorem regarding distributed model checking. Various optimization problems on graphs are expressible
Pierre Fraigniaud, Ivan Rapaport
exaly +5 more sources
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? [PDF]
Algorithmica, 2018 23 pages, 3 ...
Ignasi Sau
exaly +8 more sources
Approximation Algorithms for Treewidth, Pathwidth, and Treedepth—A Short Survey
Lecture Notes in Computer ScienceThis short survey discusses old and new approximation algorithms for treewidth, and for the related parameters pathwidth and treedepth.
Hans L Bodlaender
exaly +3 more sources
A graph searching game for block treedepth and a cubic kernel by vertex cover
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth
Proceedings of the 43rd ACM Symposium on Principles of Distributed ComputingFedor Fomin +2 more
exaly +2 more sources
Exploring the gap between treedepth and vertex cover through vertex integrity
Theoretical Computer Science, 2022Tatsuya Gima +2 more
exaly
Improved Bounds for the Excluded-Minor Approximation of Treedepth
SIAM Journal on Discrete Mathematics, 2021Wojciech Nadara, Marcin Pilipczuk
exaly
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
SIAM Journal on Discrete Mathematics, 2023Jesper Nederlof +2 more
exaly
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth
2023Amir Kafshdar Goharshady +1 more
openaire +1 more source