Candida Nunes da Silva

• IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2017), AR.EXT
• 22nd International Symposium on Mathematical Programming, AR.EXT
• VIII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2015), AR.BR

(Only some records are available in English at this moment)

• Abstract

  In 1982, Berge proposed a conjecture on directed graphs which relates directed path partitions and collections of disjoint independent sets. Berge also showed the validity of his conjecture for certain classes of graphs. In face of his observations, it is a natural question whether one similar relation exists when the roles of paths and independent sets are switched. The natural question …

  Orthogonality of packings of paths and independent sets partitions on bipartite graphs, BP.IC

• Abstract

  The subject of this project is the relation of path partitions and stable sets in digraphs. A path partition and a stable set are\emph{orthogonal} if each path in the path partition has exactly one vertex of the stable set. In 1960, Gallai and Milgram showed that a path partition with the minimum number of paths is always orthogonal to some stable set of the digraph. Thus, the minimum num…

  Path partitions and stable sets in digraphs, BP.IC

• Abstract

  We propose to study the \emph{range queries} problem, typically abbreviated as RSQ (\textsl{Range Sum Query}) or RMQ (\textsl{Range Min Query}), and also some variations of this problem. A comparative analysis of several algorithms and data structures used to solve each variation of the problem will be presented. The parameters used for comparison will be both theoretical, such as asymtop…

  Range-Queries: algorithms, data structures and applications, BP.IC

(Only some records are available in English at this moment)