activity
20052011
most citedLower Bound for the Communication Complexity of the Russian Cards Problem

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

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.CC2011

On the Complexity of Edge Packing and Vertex Packing

Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep +1

This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by ) and the vertex packing…