Let A, B, and C be three n× n matrices. We investigate the
problem of ve...
For a hypergraph H, the transversal is a subset of vertices whose
inters...
For a graph G=(V,E), a subset D of vertex set V, is a dominating set of
...
We introduce and study the complexity of Path Packing. Given a graph G a...