Bhadrachalam Chitturi

activity

20162020

most citedAdjacencies in Permutations

5 citations · 9 across the 5 of their papers we have counts for

collaborators

6 papers

cs.DS2020

An Upper Bound for Sorting $R_{n}$ with LRE

Sai Satwik Kuppili, Bhadrachalam Chitturi

A permutation $π$ over alphabet $Σ = 1, 2, 3, \dots, n$ , is a sequence where every element $x$ in $Σ$ occurs exactly once. $S_{n}$ is the symmetric group consisting of all permutations…

cs.DS2018

Sorting permutations with a transposition tree

Bhadrachalam Chitturi, Indulekha T S

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, \dots n$ }…

cs.CC2018★ 3 cited

Minimum-Link Rectilinear Covering Tour is NP-hard in $R^{4}$

Bhadrachalam Chitturi, Jayakumar Pai

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…

cs.DS2017★ 1 cited

Distances in and Layering of a DAG

Bhadrachalam Chitturi, Priyanshu Das

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)$ …

cs.DS2017

Layered graphs: a class that admits polynomial time solutions for some hard problems

Bhadrachalam Chitturi

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 independe…

cs.DM2016★ 5 cited

Adjacencies in Permutations

Bhadrachalam Chitturi, Krishnaveni K S

A permutation on an alphabet $Σ$ , is a sequence where every element in $Σ$ occurs precisely once. Given a permutation $π$ = ( $π_{1}$ , $π_{2}$ , $π_{3}$ ,....., $π_{n}$ ) over…