U. Souza

activity

20152023

most citedDecycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs

4 citations · 6 across the 10 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

cs.DM2020

On the Parameterized Complexity Of Grid Contraction

Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale

For a family of graphs $G$ , the $G$ -\textsc{Contraction} problem takes as an input a graph $G$ and an integer $k$ , and the goal is to decide if there exists $F…

cs.DS2020

Computing the Largest Bond and the Maximum Connected Cut of a Graph

Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka +6

The cut-set $\partial (S)$ of a graph $G = (V, E)$ is the set of edges that have one endpoint in $S \subset V$ and the other endpoint in $V ∖ S$ , and whenever $G [S]$ is connected…

cs.DS2020

Reducing graph transversals via edge contractions

Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau +1

For a graph invariant $π$ , the Contraction( $π$ ) problem consists in, given a graph $G$ and two positive integers $k, d$ , deciding whether one can contract at most $k$ edges of $G$ t…