Zobrazeno 1 - 10
of 1 846
pro vyhledávání: '"Raymond, Jean"'
Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced paths, a natural restriction is to forbid some fixed complete bipartite gr
Externí odkaz:
http://arxiv.org/abs/2411.08685
In this paper, we investigate the existence of parameterized algorithms running in subexponential time for two fundamental cycle-hitting problems: Feedback Vertex Set (FVS) and Triangle Hitting (TH). We focus on the class of pseudo-disk graphs, which
Externí odkaz:
http://arxiv.org/abs/2410.23878
In the $K_r$-Cover problem, given a graph $G$ and an integer $k$ one has to decide if there exists a set of at most $k$ vertices whose removal destroys all $r$-cliques of $G$. In this paper we give an algorithm for $K_r$-Cover that runs in subexponen
Externí odkaz:
http://arxiv.org/abs/2407.01465
In this work, we consider an initial-boundary value problem for a time-fractional biharmonic equation in a bounded polygonal domain with a Lipschitz continuous boundary in $\mathbb{R}^2$ with clamped boundary conditions. After establishing the well-p
Externí odkaz:
http://arxiv.org/abs/2405.11339
Publikováno v:
49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)
The goal of local certification is to locally convince the vertices of a graph $G$ that $G$ satisfies a given property. A prover assigns short certificates to the vertices of the graph, then the vertices are allowed to check their certificates and th
Externí odkaz:
http://arxiv.org/abs/2311.16953
In this paper we investigate the existence of subexponential parameterized algorithms of three fundamental cycle-hitting problems in geometric graph classes. The considered problems, \textsc{Triangle Hitting} (TH), \textsc{Feedback Vertex Set} (FVS),
Externí odkaz:
http://arxiv.org/abs/2306.17710