Results 91 to 100 of about 364 (127)

Compact Representation of Graphs with Small Bandwidth and Treedepth

2020 Data Compression Conference (DCC), 2020
We consider the problem of compact representation of graphs with small bandwidth as well as graphs with small treedepth. These parameters capture structural properties of graphs that come in useful in certain applications.
Shahin Kamali
exaly   +3 more sources

On the Lossy Kernelization for Connected Treedepth Deletion Set

Lecture Notes in Computer Science, 2022
Ramanujan Maadapuzhi Sridharan, Eduard Eiben, Diptapriyo Majumdar   +2 more
exaly   +3 more sources

Compact representation of graphs with bounded bandwidth or treedepth

Information and Computation, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shahin Kamali
exaly   +3 more sources

Approximation Algorithms for Treewidth, Pathwidth, and Treedepth—A Short Survey

Lecture Notes in Computer Science
This short survey discusses old and new approximation algorithms for treewidth, and for the related parameters pathwidth and treedepth.
Hans Bodlaender, Bodlaender Hans L
exaly   +4 more sources

A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs

Lecture Notes in Computer Science, 2021
In this article, we describe algorithms and techniques used in the method ExTREEm for the treedepth decomposition problem. ExTREEm won the heuristic track of the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2020). It searches for a minimum-height treedepth decomposition of a graph via computing graph separators.
Sylwester Swat, Marta Kasprzak, Kasprzak Marta   +2 more
exaly   +3 more sources

Treedepth Bounds in Linear Colorings

Lecture Notes in Computer Science, 2018
Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treedepth. These colorings have an implicit tradeoff between the total number of colors used and the treedepth bound, and prior empirical work suggests that the former dominates ...
Blair D Sullivan, Jeremy Kun
exaly   +4 more sources

Computing Treedepth Obstructions

CoRR
The graph parameter treedepth is minor-monotone; hence, the class of graphs with treedepth at most $k$ is minor-closed. By the Graph Minor Theorem, such a class is characterized by a finite set of forbidden minors.
K. Kühn
semanticscholar   +3 more sources

A graph searching game for block treedepth and a cubic kernel by vertex cover

Theoretical Computer Science
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Archontia C Giannopoulou, Fílippos Mavropoulos   +1 more
exaly   +5 more sources

An Algorithm for the Exact Treedepth Problem

CoRR, 2020
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to the optimal treedepth decomposition problem. Our algorithm makes use of two cheaply-computed lower bound functions to prune the search tree, along with ...
James Trimble
semanticscholar   +5 more sources

The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

SIAM Journal on Discrete Mathematics, 2016
Summary: In the mixed Chinese postman problem (MCPP), given a weighted mixed graph \(G\) (it may have both edges and arcs), our aim is to find a closed walk of minimum weight traversing each edge and arc at least once. The MCPP parameterized by the number of edges in \(G\) or the number of arcs in \(G\) is fixed-parameter tractable as proved by \textit{
Magnus Wahlstrom, Gregory Gutin
exaly   +4 more sources