A. Adiga

most citedA Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs

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

collaborators

2 papers

cs.DS2011★ 3 cited

A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs

Abhijin Adiga, Jasine Babu, L. Sunil Chandran

Boxicity of a graph $G (V, E)$ is the minimum integer $k$ such that $G$ can be represented as the intersection graph of $k$ -dimensional axis parallel rectangles in $R^{k}$ . Eq…

math.CO2009

Cubicity of interval graphs and the claw number

Abhijin Adiga, L. Sunil Chandran

Let $G (V, E)$ be a simple, undirected graph where $V$ is the set of vertices and $E$ is the set of edges. A $b$ -dimensional cube is a Cartesian product $I_1\times I_2\times...\times…