Letícia Rodrigues Bueno

Letícia Rodrigues Bueno

Auto-generated profile, based on publicly available information

Letícia Rodrigues Bueno

Center for Mathematics, Computation and Cognition, Federal University of ABC, Santo André 09210-170, Brazil

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2018 in Information Processing Letters
Verified
Journal Article
Closed access
LBLetícia R. Bueno
Letícia R. Bueno
LPLucia D. Penso
Lucia D. Penso
FPFábio Protti
Fábio Protti
VRVictor R. Ramos
Victor R. Ramos
DRDieter Rautenbach
Dieter Rautenbach
USUeverton Souza
Ueverton Souza

1 January 2009 in Applicable Analysis and Discrete Mathematics
Verified
Journal Article
Open access
PDF file
LBLetícia R. Bueno
Letícia R. Bueno
LFLuerbio Faria
Luerbio Faria
FDFigueiredo Celina M.H. De
Figueiredo Celina M.H. De
FDFonseca Guilherme D. Da
Fonseca Guilherme D. Da
Lov?sz conjectured that every connected vertex-transitive graph has a Hamiltonian path. The odd graphs Ok form a well-studied family of connected, k-regular, vertex-transitive graphs. It was previously known that Ok has Hamiltonian paths for k ? 14. A direct computation of Hamiltonian paths in Ok is not feasible for large values of k, because Ok has (2k - 1, k - 1) vertices and k/2 (2k - 1, k - 1) edges. We show that Ok has Hamiltonian paths for 15 ? k ? 18. Instead of directly running any heuristics, we use existing results on the middle levels problem, therefore further relating these two fundamental problems, namely finding a Hamiltonian path in the odd graph and finding a Hamiltonian cycle in the corresponding middle levels graph. We show that further improved results for the middle levels problem can be used to find Hamiltonian paths in Ok for larger values of k.

12 November 2010 in Journal of Graph Theory
Verified
Journal Article
Closed access
PDF file
LBLetícia R. Bueno
Letícia R. Bueno
PHPeter Horák
Peter Horák

1 June 2020 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
MBMarco A. L. Barbosa
Marco A. L. Barbosa
ADALEXANDRE CLAUDIO BOTAZZO DELBEM
ALEXANDRE CLAUDIO BOTAZZO DELBEM
LBLeticia R. Bueno
Leticia R. Bueno
Optimization methods for spanning tree problems may require efficient data structures. The node-depth-degree representation (NDDR) has achieved relevant results for direct spanning tree representation together with evolutionary algorithms (EAs). Its two mutation operators have average time O(root n), where n is the number of vertices of the graph, while similar operators implemented by predecessor arrays, a typical tree data structure, have time O(n). Dynamic trees are also relevant when investigating tree representations since they have low time complexity, but there is no proper extension of them for EAs. Using aspects of both a dynamic tree and NDDR, namely, Euler tours and structural sharing, we propose a data structure called 2LETT, whose mutation operators have time O(root n) in the worst case. Experiments with the mutation operators using 2LETT, predecessor arrays, and NDDR are carried out for graphs with up to 300 000 vertices. For a mutation operator that exchanges any two valid edges, predecessor arrays present the best performance for random trees with fewer than 10 000 vertices; while 2LETT has the best performance for trees with more than 10 000 vertices. Especially, noteworthy is the fact that 2LETT is the only structure whose running time is independent of tree diameter.

1 August 2011 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
LBL.R. Bueno
L.R. Bueno
CFC.M.H. Figueiredo
C.M.H. Figueiredo
LFL. Faria
L. Faria
CMC.F.X. Mendonça
C.F.X. Mendonça
RHR.A. Hausen
R.A. Hausen

1 September 2015 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
CRC.S. Reis
C.S. Reis
LKL.A.B. Kowada
L.A.B. Kowada
LBL.R. Bueno
L.R. Bueno
ARA.C. Ribeiro
A.C. Ribeiro
CFC.M.H. Figueiredo
C.M.H. Figueiredo