3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 3 cited
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound
R. Crowston, G. Gutin, M. Jones +1
We consider graphs without loops or parallel edges in which every edge is assigned + or -. Such a signed graph is balanced if its vertex set can be partitioned into parts and…
cs.DS2012
Parameterizations of Test Cover with Bounded Test Sizes
Robert Crowston, Gregory Gutin, Mark Jones +2
In the {\sc Test Cover} problem we are given a hypergraph with , and we assume that is a test cover, i.e. for every pair…