Results 121 to 127 of about 364 (127)

Polynomial Treedepth Bounds in Linear Colorings

Algorithmica, 2020
Marcin Pilipczuk, Blair D Sullivan, Jeremy Kun   +2 more
exaly  

PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions

International Symposium on Parameterized and Exact Computation, 2020
Marcin Wrochna
semanticscholar   +1 more source

PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem

International Symposium on Parameterized and Exact Computation, 2020
Sylwester Swat
semanticscholar   +1 more source

PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth

International Symposium on Parameterized and Exact Computation, 2020
James Trimble
semanticscholar   +1 more source

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?

Algorithmica, 2018
Ignasi Sau, Marin Bougeret, Sau Ignasi   +2 more
exaly  

On the size of minimal separators for treedepth decomposition

Discrete Applied Mathematics
Vorapong Suppakitpaisarn
exaly  

Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca   +4 more
openaire   +1 more source