Bhadrachalam Chitturi

activity

20162020

most citedAdjacencies in Permutations

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

collaborators

Showing 2017Show all

2 papers · 1 filter

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…