Zobrazeno 1 - 10
of 1 216
pro vyhledávání: '"Aravind N."'
Autor:
Aravind, N. R., Saxena, Roopam
In Terminal Monitoring Set (TMS), the input is an undirected graph $G=(V,E)$, together with a collection $T$ of terminal pairs and the goal is to find a subset $S$ of minimum size that hits a shortest path between every pair of terminals. We show tha
Externí odkaz:
http://arxiv.org/abs/2406.01730
Suppose we are given a set $\cal B$ of blue points and a set $\cal R$ of red points, all lying above a horizontal line $\ell$, in the plane. Let the weight of a given point $p_i\in {\cal B}\cup{\cal R}$ be $w_i>0$ if $p_i\in {\cal B}$ and $w_i<0$ if
Externí odkaz:
http://arxiv.org/abs/2307.03488
Autor:
Daniels, R. J. Ranjit
Publikováno v:
Current Science, 2017 Aug 01. 113(3), 506-507.
Externí odkaz:
http://www.jstor.org/stable/26294013
Autor:
Aravind, N. R., Saxena, Roopam
In Path Set Packing, the input is an undirected graph $G$, a collection $\calp$ of simple paths in $G$, and a positive integer $k$. The problem is to decide whether there exist $k$ edge-disjoint paths in $\calp$. We study the parameterized complexity
Externí odkaz:
http://arxiv.org/abs/2209.08757
We introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 x 8 chessboard by a single player, with only white pieces, using the followi
Externí odkaz:
http://arxiv.org/abs/2203.14864
Autor:
Aravind, N. R., Saxena, Roopam
In an undirected graph $G=(V,E)$, we say $(A,B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$) has exactly one neighbor in $B$ (resp. $A$). The size of a pair of perfectly matched s
Externí odkaz:
http://arxiv.org/abs/2107.08584
Autor:
Aravind, N R, Saxena, Roopam
Given a positive integer $d$, the d-CUT is the problem of deciding if an undirected graph $G=(V,E)$ has a cut $(A,B)$ such that every vertex in $A$ (resp. $B$) has at most $d$ neighbors in $B$ (resp. $A$). For $d=1$, the problem is referred to as MAT
Externí odkaz:
http://arxiv.org/abs/2101.06998
Autor:
Aravind, N. R., Maniyar, Udit
Publikováno v:
In: Changat M., Das S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science, vol 12016. Springer, Cham (2020)
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices has a repres
Externí odkaz:
http://arxiv.org/abs/2010.01286
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.