F
Fábio Protti
Researcher at Federal Fluminense University
Publications - 147
Citations - 1435
Fábio Protti is an academic researcher from Federal Fluminense University. The author has contributed to research in topics: Chordal graph & Treewidth. The author has an hindex of 18, co-authored 134 publications receiving 1221 citations. Previous affiliations of Fábio Protti include Federal University of Rio de Janeiro.
Papers
More filters
Journal ArticleDOI
On the computation of the hull number of a graph
TL;DR: This work proves that deciding whether hn(G)@?k is NP-complete and presents polynomial-time algorithms for computing hn (G) when G is a unit interval graph, a cograph or a split graph.
Journal ArticleDOI
Complexity results related to monophonic convexity
TL;DR: It is proved that the decision problems corresponding to the m-convexity and monophonic numbers are NP-complete, and the size of a minimum subset whose convex hull is equal to V(G) (m-hull number) is described.
Journal ArticleDOI
Applying Modular Decomposition to Parameterized Cluster Editing Problems
TL;DR: An algorithm of time complexity O(4k+n+m), which uses a strategy based on modular decomposition techniques; this strategy leads to a new way of obtaining a problem kernel with O(k2) vertices for the Cluster(k) Graph Editing problem, in O(n-m) time.
Journal ArticleDOI
Some remarks on the geodetic number of a graph
TL;DR: It is proved that it is NP-complete to decide for a given chordal or chordal bipartite graph G and a given integer k whether G has a geodetic set of cardinality at most k.
Journal ArticleDOI
List matrix partitions of chordal graphs
TL;DR: This paper shows that many M-partition problems that are NP-complete in general become solvable in polynomial time for chordal graphs, even in the presence of lists, and identifies large families of matrices M for which dichotomy, or at least quasi-dichotomy, holds.