Zobrazeno 1 - 10
of 619
pro vyhledávání: '"MUKHERJEE, JOYDEEP"'
For a graph $ G = (V, E) $ with a vertex set $ V $ and an edge set $ E $, a function $ f : V \rightarrow \{0, 1, 2, . . . , diam(G)\} $ is called a \emph{broadcast} on $ G $. For each vertex $ u \in V $, if there exists a vertex $ v $ in $ G $ (possi
Externí odkaz:
http://arxiv.org/abs/2312.10485
Function as a Service (FaaS) is a new cloud technology with automated resource management. Different from traditional cloud computing, each FaaS cloud function can only run a fixed period of time before being decommissioned. Furthermore, FaaS cloud p
Externí odkaz:
http://arxiv.org/abs/2203.10227
Autor:
Sahoo, Rabi N., Rejith, R.G., Gakhar, Shalini, Verrelst, Jochem, Ranjan, Rajeev, Kondraju, Tarun, Meena, Mahesh C., Mukherjee, Joydeep, Dass, Anchal, Kumar, Sudhir, Kumar, Mahesh, Dhandapani, Raju, Chinnusamy, Viswanathan
Publikováno v:
In Computers and Electronics in Agriculture June 2024 221
Autor:
Mukherjee, Joydeep1 (AUTHOR), Mitra, Sayantan1 (AUTHOR), Sutradhar, Sushanta1 (AUTHOR), Mondal, Sonjoy1 (AUTHOR), Barman, Chiranjib1 (AUTHOR) chiranjib-barman@skbu.ac.in
Publikováno v:
Journal of Radioanalytical & Nuclear Chemistry. Mar2024, Vol. 333 Issue 3, p1427-1441. 15p.
A terrain is an $x$-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in $O(n \log n)$ time, where $n$ is the number of vertices defining the terrain. The best prev
Externí odkaz:
http://arxiv.org/abs/2104.11420
We present an approximation algorithm for the maximum independent set (MIS) problem over the class of equilateral $B_1$-VPG graphs. These are intersection graphs of $L$-shaped planar objects % (and their rotations by multiples of $90^o$) with both ar
Externí odkaz:
http://arxiv.org/abs/1912.07957
Publikováno v:
In Discrete Applied Mathematics 30 October 2023 338:69-76
Autor:
Das, Bappa, Rathore, Pooja, Roy, Debasish, Chakraborty, Debashis, Bhattacharya, Bimal Kumar, Mandal, Dipankar, Jatav, Raghuveer, Sethi, Deepak, Mukherjee, Joydeep, Sehgal, Vinay Kumar, Singh, Amit Kumar, Kumar, Parveen
Publikováno v:
In Agricultural and Forest Meteorology 15 August 2023 339
In this paper, we give approximation algorithms for the \textsc{Minimum Dominating Set (MDS)} problem on \emph{string} graphs and its subclasses. A \emph{path} is a simple curve made up of alternating horizontal and vertical line segments. A \emph{$k
Externí odkaz:
http://arxiv.org/abs/1809.09990