Zobrazeno 1 - 10
of 772
pro vyhledávání: '"LOKSHTANOV, DANIEL"'
Autor:
Bandyapadhyay, Sayan, Lochet, William, Lokshtanov, Daniel, Marx, Dániel, Misra, Pranabendu, Neuen, Daniel, Saurabh, Saket, Tale, Prafullkumar, Xue, Jie
We prove a robust contraction decomposition theorem for $H$-minor-free graphs, which states that given an $H$-minor-free graph $G$ and an integer $p$, one can partition in polynomial time the vertices of $G$ into $p$ sets $Z_1,\dots,Z_p$ such that $\
Externí odkaz:
http://arxiv.org/abs/2412.04145
Autor:
Kumar, Mithilesh, Lokshtanov, Daniel
A {\em bipartite tournament} is a directed graph $T:=(A \cup B, E)$ such that every pair of vertices $(a,b), a\in A,b\in B$ are connected by an arc, and no arc connects two vertices of $A$ or two vertices of $B$. A {\em feedback vertex set} is a set
Externí odkaz:
http://arxiv.org/abs/2411.02821
The \textsc{Capacitated $d$-Hitting Set} problem involves a universe $U$ with a capacity function $\mathsf{cap}: U \rightarrow \mathbb{N}$ and a collection $\mathcal{A}$ of subsets of $U$, each of size at most $d$. The goal is to find a minimum subse
Externí odkaz:
http://arxiv.org/abs/2410.20900
In this article we show that Maximum Partial List H-Coloring is polynomial-time solvable on P_5-free graphs for every fixed graph H. In particular, this implies that Maximum k-Colorable Subgraph is polynomial-time solvable on P_5-free graphs. This an
Externí odkaz:
http://arxiv.org/abs/2410.21569
The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph $G$ in a given order and assigns the first available color to each vertex $v$ in $G$. In the {\sc Grundy Coloring} problem, the task is to find an ordering of
Externí odkaz:
http://arxiv.org/abs/2410.20629
In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that Hedge Cut ca
Externí odkaz:
http://arxiv.org/abs/2410.17641
We give two new approximation algorithms to compute the fractional hypertree width of an input hypergraph. The first algorithm takes as input $n$-vertex $m$-edge hypergraph $H$ of fractional hypertree width at most $\omega$, runs in polynomial time a
Externí odkaz:
http://arxiv.org/abs/2409.20172
For a finite set $\mathcal{F}$ of graphs, the $\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\in\mathbb{N}$, a set $S$ of vertices in
Externí odkaz:
http://arxiv.org/abs/2409.04786
In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which generalizes bo
Externí odkaz:
http://arxiv.org/abs/2407.09356
We prove that the tree independence number of every even-hole-free graph is at most polylogarithmic in its number of vertices. More explicitly, we prove that there exists a constant c>0 such that for every integer n>1 every n-vertex even-hole-free gr
Externí odkaz:
http://arxiv.org/abs/2407.08927