Bhadrachalam Chitturi

activity

20172020

most citedDistances in and Layering of a DAG

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

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

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…

Sorting permutations with a transposition tree

Minimum-Link Rectilinear Covering Tour is NP-hard in R4

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