3 papers
cs.DS2020
FPT and kernelization algorithms for the k-in-a-tree problem
Guilherme C. M. Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva +1
The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the fir…
cs.DS2019
Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory
Alane M. de Lima, Murilo V. G. da Silva, André L. Vignatti
In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a g…
cs.CC2018
An Indexing for Quadratic Residues Modulo and a Non-uniform Efficient Decoding Algorithm
Nicollas M. Sdroievski, Murilo V. G. da Silva, André L. Vignatti
An \emph{indexing} of a finite set is a bijection . We present an indexing for the set of quadratic residues modulo that is decodable in po…