Avinandan Das
YOU?
Author Swipe
View article: Semi-Streaming Algorithms for Graph Property Certification
Semi-Streaming Algorithms for Graph Property Certification Open
We introduce the {\em certification} of solutions to graph problems when access to the input is restricted. This topic has received a lot of attention in the distributed computing setting, and we introduce it here in the context of \emph{s…
View article: Distributed Partial Coloring via Gradual Rounding
Distributed Partial Coloring via Gradual Rounding Open
For k ≥ 0, k-partial (k+1)-coloring asks to color the nodes of an n-node graph using a palette of k+1 colors such that every node v has at least min{k,deg(v)} neighbors colored with colors different from its own color. Hence, proper (Δ+1)-…
View article: Problems on One Way Road Networks
Problems on One Way Road Networks Open
A One-Way Road Network is an ordered pair $OWRN = (W_x,W_y)$ comprising of a set $W_x$ of $m$ directed horizontal roads along with another set $W_y$ of $n$ directed vertical roads. An $OWRN$ can also be viewed as a directed grid graph $GG=…
View article: Problems on One Way Road Networks
Problems on One Way Road Networks Open
Let $OWRN = \left\langle W_x,W_y \right\rangle$ be a One Way Road Network where $W_x$ and $W_y$ are the sets of directed horizontal and vertical roads respectively. $OWRN$ can be considered as a variation of directed grid graph. The inters…