5 citations · 6 across the 5 of their papers we have counts for
6 papers
Thinness and its variations on some graph families and coloring graphs of bounded thinness
Flavia Bonomo-Braberman, Eric Brandwein, Fabiano S. Oliveira +3
Interval graphs and proper interval graphs are well known graph classes, for which several generalizations have been proposed in the literature. In this work, we study the (proper)…
Precedence thinness in graphs
Flavia Bonomo-Braberman, Fabiano S. Oliveira, Moysés S. Sampaio +1
Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been pro…
Linear-time Algorithms for Eliminating Claws in Graphs
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano S. Oliveira +2
Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given grap…
On the mediation of program allocation in high-demand environments
Fabiano de S. Oliveira, Valmir C. Barbosa
In this paper we challenge the widely accepted premise that, in order to carry out a distributed computation, say on the cloud, users have to inform, along with all the inputs that…
Counting independent terms in big-oh notation
Fabiano de S. Oliveira, Valmir C. Barbosa
The field of computational complexity is concerned both with the intrinsic hardness of computational problems and with the efficiency of algorithms to solve them. Given such a prob…
Revisiting deadlock prevention: a probabilistic approach
Fabiano de S. Oliveira, Valmir C. Barbosa
We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in te…