Zobrazeno 1 - 10
of 153
pro vyhledávání: '"Roy, Sasanka"'
Autor:
Banik, Aritra, Das, Sayani, Maheshwari, Anil, Manna, Bubai, Nandy, Subhas C, M, Krishna Priya K, Roy, Bodhayan, Roy, Sasanka, Sahu, Abhishek
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph $G=(V,E)$, consisting of a vertex set $V$ of size $n$ and an edge set $E$. Each vertex in $V$ is assigned a color from the set $\{1,2,\ldots, c\
Externí odkaz:
http://arxiv.org/abs/2404.15487
Autor:
De Carufel, Jean-Lou, Hill, Darryl, Maheshwari, Anil, Roy, Sasanka, da Silveira, Luís Fernando Schultz Xavier
The following geometric vehicle scheduling problem has been considered: given continuous curves $f_1, \ldots, f_n : \mathbb{R} \rightarrow \mathbb{R}^2$, find non-negative delays $t_1, \ldots, t_n$ minimizing $\max \{ t_1, \ldots, t_n \}$ such that,
Externí odkaz:
http://arxiv.org/abs/2107.04657
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line segments ${\ca
Externí odkaz:
http://arxiv.org/abs/1909.09445
Let $G = (V, E)$ be an edge-weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge $uv \in E$ is its length. Let $ W_G (u,v)$ denote the length of a shortest path between a pair of vertices $u$ and $v$ in $G$.
Externí odkaz:
http://arxiv.org/abs/1909.06457
We study the Balanced Connected Subgraph(shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given a vertex-colored graph $G=(V,E)$, where each vertex in $V$ is colo
Externí odkaz:
http://arxiv.org/abs/1909.03872
We study the Maximum Bipartite Subgraph (MBS) problem, which is defined as follows. Given a set $S$ of $n$ geometric objects in the plane, we want to compute a maximum-size subset $S'\subseteq S$ such that the intersection graph of the objects in $S'
Externí odkaz:
http://arxiv.org/abs/1909.03896
Autor:
De Carufel, Jean-Lou, Hill, Darryl, Maheshwari, Anil, Roy, Sasanka, da Silveira, Luís Fernando Schultz Xavier
Publikováno v:
In Discrete Applied Mathematics 15 November 2023 339:1-10
Autor:
Bhore, Sujoy, Chakraborty, Sourav, Jana, Satyabrata, Mitchell, Joseph S. B., Pandit, Supantha, Roy, Sasanka
The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly, BCS) prob
Externí odkaz:
http://arxiv.org/abs/1809.08856
We study the problem of finding a \textit{maximal} transitive relation contained in a given binary relation. Given a binary relation of size $m$ defined on a set of size $n$, we present a polynomial time algorithm that finds a maximal transitive sub-
Externí odkaz:
http://arxiv.org/abs/1805.08953
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:71-80