Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Galby, Esther"'
Autor:
Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on $n$ vertices
Externí odkaz:
http://arxiv.org/abs/2405.01344
We investigate a relaxation of the notion of fractional treewidth-fragility, namely fractional tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for meta-problems such as finding a maximum-weight spars
Externí odkaz:
http://arxiv.org/abs/2402.18352
Autor:
Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar
Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT parameteriz
Externí odkaz:
http://arxiv.org/abs/2307.08149
We investigate a relaxation of the notion of treewidth-fragility, namely tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-frag
Externí odkaz:
http://arxiv.org/abs/2303.07444
In the Directed Steiner Network problem, the input is a directed graph G, a subset T of k vertices of G called the terminals, and a demand graph D on T. The task is to find a subgraph H of G with the minimum number of edges such that for every edge (
Externí odkaz:
http://arxiv.org/abs/2208.06015
The leafage of a chordal graph G is the minimum integer l such that G can be realized as an intersection graph of subtrees of a tree with l leaves. We consider structural parameterization by the leafage of classical domination and cut problems on cho
Externí odkaz:
http://arxiv.org/abs/2208.02850
For a graph $G$, a subset $S \subseteq V(G)$ is called a \emph{resolving set} if for any two vertices $u,v \in V(G)$, there exists a vertex $w \in S$ such that $d(w,u) \neq d(w,v)$. The {\sc Metric Dimension} problem takes as input a graph $G$ and a
Externí odkaz:
http://arxiv.org/abs/2206.15424
Autor:
Galby, Esther
We consider the problem of reducing the (semi)total domination number of graph by one by contracting edges. It is known that this can always be done with at most three edge contractions and that deciding whether one edge contraction suffices is an $\
Externí odkaz:
http://arxiv.org/abs/2205.12821
The Edge Multicut problem is a classical cut problem where given an undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget $k$, the goal is to determine if there is a set $S$ of at most $k$ edges such that for each $(s,t) \in \m
Externí odkaz:
http://arxiv.org/abs/2205.10105
In this paper, we consider the problem of reducing the semitotal domination number of a given graph by contracting $k$ edges, for some fixed $k \geq 1$. We show that this can always be done with at most 3 edge contractions and further characterise th
Externí odkaz:
http://arxiv.org/abs/2107.03755