Gabriel L. Duarte

activity

20192022

collaborators

3 papers

cs.DS2022

On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy

Gabriel L. Duarte, Uéverton S. Souza

In 2021, Duarte, Oliveira, and Souza [MFCS 2021] showed some problems that are FPT when parameterized by the treewidth of the complement graph (called co-treewidth). Since the dege…

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.DS2019

Computing the largest bond of a graph

Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa +2

A bond of a graph $G$ is an inclusion-wise minimal disconnecting set of $G$ , i.e., bonds are cut-sets that determine cuts $[S, V ∖ S]$ of $G$ such that $G [S]$ and $G[V\setmin…