Marcelo Henriques De Carvalho

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Our main result is an <i>O</i>(<i>nm</i>)-time (deterministic) algorithm for constructing an ear decomposition of a matching-covered graph, improving on the previous best running time of <i>O</i>(<i>nm</i><sup>2</sup>). where <i>n</i> and <i>m</i> denote the number of nodes and edges. The improvement in the running time comes from new structural results(More)
We introduce a semi-supervised pattern classification approach based on the optimum-path forest (OPF) methodology. The method transforms the training set into a graph, finds prototypes in all classes among labeled training nodes, as in the original supervised OPF training, and propagates the class of each prototype to its most closely connected samples(More)
  • 1