Shashank K. Mehta

activity

20112019

most citedNew Facets of the QAP-Polytope

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

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2019

Depth First Search in the Semi-streaming Model

Shahbaz Khan, Shashank K. Mehta

Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O (m + n)$ time for a graph having $n$ vertices…

cs.DS2013

Completely Positive formulation of the Graph Isomorphism Problem

Shashank K Mehta, Pawan Aurora

Given two graphs $G_{1}$ and $G_{2}$ on $n$ vertices each, we define a graph $G$ on vertex set $V_{1} \times V_{2}$ and the edge set as the union of edges of $G_{1} \times G_{2} ˉ$ , $\bar{G_…

cs.DS2012

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

Pawan Aurora, Sumit Singh, Shashank K. Mehta

We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform degree constraint. They a…