Zobrazeno 1 - 10
of 344
pro vyhledávání: '"AGRAWAL, AKANKSHA"'
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
Autor:
Agrawal, Akanksha, Cabello, Sergio, Kaufmann, Michael, Saurabh, Saket, Sharma, Roohani, Uno, Yushi, Wolff, Alexander
Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest number of vertices or edges such that the remaining graph can be drawn
Externí odkaz:
http://arxiv.org/abs/2404.09771
Autor:
Agrawal, Akanksha, Lima, Paloma T., Lokshtanov, Daniel, Rzążewski, Pawel, Saurabh, Saket, Sharma, Roohani
An independent set in a graph G is a set of pairwise non-adjacent vertices. A graph $G$ is bipartite if its vertex set can be partitioned into two independent sets. In the Odd Cycle Transversal problem, the input is a graph $G$ along with a weight fu
Externí odkaz:
http://arxiv.org/abs/2402.11465
A proper Helly circular-arc graph is an intersection graph of a set of arcs on a circle such that none of the arcs properly contains any other arc and every set of pairwise intersecting arcs has a common intersection. The Proper Helly Circular-arc Ve
Externí odkaz:
http://arxiv.org/abs/2401.03415
The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by the subn
Externí odkaz:
http://arxiv.org/abs/2212.14542
Clustering with outliers is one of the most fundamental problems in Computer Science. Given a set $X$ of $n$ points and two integers $k$ and $m$, the clustering with outliers aims to exclude $m$ points from $X$ and partition the remaining points into
Externí odkaz:
http://arxiv.org/abs/2212.00696
A square coloring of a graph $G$ is a coloring of the square $G^2$ of $G$, that is, a coloring of the vertices of $G$ such that any two vertices that are at distance at most $2$ in $G$ receive different colors. We investigate the complexity of findin
Externí odkaz:
http://arxiv.org/abs/2211.04458
Publikováno v:
17th International Symposium on Parameterized and Exact Computation (IPEC), 2022
The \emph{Delaunay graph} of a point set $P \subseteq \mathbb{R}^2$ is the plane graph with the vertex-set $P$ and the edge-set that contains $\{p,p'\}$ if there exists a disc whose intersection with $P$ is exactly $\{p,p'\}$. Accordingly, a triangul
Externí odkaz:
http://arxiv.org/abs/2210.03932
Assume we are given a graph $G$, two independent sets $S$ and $T$ in $G$ of size $k \geq 1$, and a positive integer $\ell \geq 1$. The goal is to decide whether there exists a sequence $\langle I_0, I_1, ..., I_\ell \rangle$ of independent sets such
Externí odkaz:
http://arxiv.org/abs/2209.05145
A graph $G$ is well-covered if every minimal vertex cover of $G$ is minimum, and a graph $G$ is well-dominated if every minimal dominating set of $G$ is minimum. Studies on well-covered graphs were initiated in [Plummer, JCT 1970], and well-dominated
Externí odkaz:
http://arxiv.org/abs/2208.08864