G. Muciaccia

most citedMaximum Balanced Subgraph Problem Parameterized Above Lower Bound

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

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2013

Parameterized Complexity of k-Chinese Postman Problem

Gregory Gutin, Gabriele Muciaccia, Anders Yeo

We consider the following problem called the $k$ -Chinese Postman Problem ( $k$ -CPP): given a connected edge-weighted graph $G$ and integers $p$ and $k$ , decide whether there are at…

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 $V_{1}$ 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 $H = (V, E)$ with $∣ V ∣ = n, ∣ E ∣ = m$ , and we assume that $E$ is a test cover, i.e. for every pair…