7 citations · 29 across the 20 of their papers we have counts for
6 papers · 1 filter
Characterizations of graph classes via convex geometries: a survey
Mitre C. Dourado, Marisa Gutierrez, Fábio Protti +2
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexi…
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
Fábio Protti, Uéverton S. Souza
A graph is {\em matching-decyclable} if it has a matching such that is acyclic. Deciding whether is matching-decyclable is an NP-complete problem even if is 2…
A general framework for path convexities
João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti +3
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with…
Cograph generation with linear delay
Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio
Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cog…
Clique cycle-transversals in distance-hereditary graphs
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira +1
A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a cliq…
On simulating nondeterministic stochastic activity networks
Valmir C. Barbosa, Fernando M. L. Ferreira, Daniel V. Kling +3
In this work we deal with a mechanism for process simulation called a NonDeterministic Stochastic Activity Network (NDSAN). An NDSAN consists basically of a set of activities along…