29 citations · 79 across the 10 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013★ 1 cited
An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph
Rosa Figueiredo, Yuri Frota
The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. We are interes…
cs.DM2005★ 6 cited
Acyclic orientations with path constraints
Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan +1
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diamet…