Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Bhadrachalam, A."'
Publikováno v:
Mathematics, Vol 12, Iss 17, p 2620 (2024)
With applications in computer networks, robotics, genetics, data center network optimization, cryptocurrency exchange, transportation and logistics, cloud computing, and social network analysis, the problem of sorting permutations on transposition tr
Externí odkaz:
https://doaj.org/article/c3d7153ee97a4b969d462cbbd6ac5f0a
A permutation $\pi$ over alphabet $\Sigma = {1,2,3,\ldots,n}$, is a sequence where every element $x$ in $\Sigma$ occurs exactly once. $S_n$ is the symmetric group consisting of all permutations of length $n$ defined over $\Sigma$. $I_n$ = $(1, 2, 3,\
Externí odkaz:
http://arxiv.org/abs/2002.07342
Autor:
P., Jayakumar, Chitturi, Bhadrachalam
Publikováno v:
In Computers in Biology and Medicine October 2023 165
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.
Autor:
Chitturi, Bhadrachalam, S, Indulekha T
The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$ and $\pi$
Externí odkaz:
http://arxiv.org/abs/1811.07443
Autor:
Chitturi, Bhadrachalam, Pai, Jayakumar
Given a set $P$ of $n$ points in $R^{d}$, a tour is a closed simple path that covers all the given points, i.e. a Hamiltonian cycle. % In $P$ if no three points are collinear then the points are said to be in general position. A \textit{link} is a li
Externí odkaz:
http://arxiv.org/abs/1810.00529
Autor:
Chitturi, Bhadrachalam, Das, Priyanshu
The diameter of an undirected unweighted graph $G=(V,E)$ is the maximum value of the distance from any vertex $u$ to another vertex $v$ for $u,v \in V$ where distance i.e. $d(u,v)$ is the length of the shortest path from $u$ to $v$ in $G$. DAG, is a
Externí odkaz:
http://arxiv.org/abs/1711.03256
Autor:
Chitturi, Bhadrachalam
The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent set or MIS.
Externí odkaz:
http://arxiv.org/abs/1705.06425
Publikováno v:
In Theoretical Computer Science 6 December 2021 896:158-167
Autor:
Pai, Jayakumar, Chitturi, Bhadrachalam
Publikováno v:
In Theoretical Computer Science 4 November 2021 891:105-115