We present an integer linear program (IP), for the Graph Isomorphism (GI) problem, which has non-empty feasible solution if and only if the input pair of graphs are isomorphic. We study the polytopeâ€¦ (More)

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 also presentedâ€¦ (More)

Given two graphs G1 and G2 on n vertices each, we define a graph G on vertex set V1 Ã— V2 and the edge set as the union of edges of G1 Ã— Â¯ that the function evaluates to n whenever G1 and G2 areâ€¦ (More)

Given two graphs G1 and G2 on n vertices each, we define a graph G on vertex set V1 Ã— V2 and the edge set as the union of edges of G1 Ã— Â¯ that the function evaluates to n whenever G1 and G2 areâ€¦ (More)

We report here on R&D efforts on technology being developed for processing cells and modules based on silicon ribbon wafers produced by the edge-defined film-fed growth (EFG) technique. Manufacturingâ€¦ (More)

Barrier synchronization is widely used in shared-memory parallel programs to synchronize between phases of data-parallel algorithms. With proliferation of many-core processors, barrierâ€¦ (More)

Given a graph G = (V,E) and a non-negative integer cu for each u âˆˆ V , Partial Degree Bounded Edge Packing (PDBEP) problem is to find a subgraph Gâ€² = (V,Eâ€²) with maximum |Eâ€²| such that for each edgeâ€¦ (More)