7 citations · 29 across the 20 of their papers we have counts for
5 papers · 1 filter
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro +2
A knot in a directed graph is a strongly connected subgraph of with at least two vertices, such that no vertex in is an in-neighbor of a vertex in $V(G)\setminus…
New algorithms for the Minimum Coloring Cut Problem
Augusto Bordini, Fábio Protti
The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose removal renders the gra…
Parameterized mixed cluster editing via modular decomposition
Maise Dantas da Silva, Fábio Protti, Jayme Luiz Szwarcfiter
In this paper we introduce a natural generalization of the well-known problems Cluster Editing and Bicluster Editing, whose parameterized versions have been intensively investigate…
An energy function and its application to the periodic behavior of k-reversible processes
Leonardo I. L. Oliveira, Valmir C. Barbosa, Fábio Protti
We consider the graph dynamical systems known as k-reversible processes. In such processes, each vertex in the graph has one of two possible states at each discrete time step. Each…
The predecessor-existence problem for k-reversible processes
Leonardo I. L. Oliveira, Valmir C. Barbosa, Fábio Protti
For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Ea…