Letícia Rodrigues Bueno
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Letícia Rodrigues Bueno has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
C.M.H. Figueiredo
Federal University of Rio de Janeiro
2 shared publicationsA.C. Ribeiro
1 shared publication- Alexandre Claudio Botazzo Delbem
Institute of Mathematics and Computer Science, University of São Paulo, Av. Trabalhador São-carlense, 400, São Carlos, 13566-590, SP, Brazil
1 shared publication Andréia C.S. Gusmão
1 shared publicationC.F.X. Mendonça
1 shared publicationC.S. Reis
1 shared publication
Latest Publications
- 1 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 24 (3) , 467-478
Data Structures for Direct Spanning Tree Representations in Mutation-Based Evolutionary Algorithms
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 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 24 (3) , 467-478
Data Structures for Direct Spanning Tree Representations in Mutation-Based Evolutionary Algorithms
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 July 2018
- Published by Elsevier in Information Processing Letters
- Vol. 135, 22-27
On the hardness of finding the geodetic number of a subcubic graph
- 1 July 2018
- Published by Elsevier in Information Processing Letters
- Vol. 135, 22-27
On the hardness of finding the geodetic number of a subcubic graph
- 1 September 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 210, 290-296
A note on the middle levels problem
- 1 September 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 210, 290-296
A note on the middle levels problem
- 1 September 2015
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 192, 82-86
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
- 1 September 2015
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 192, 82-86
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 379-390
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 379-390
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
- 1 August 2011
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 37, 291-296
Hamiltonian Cycles in Kneser Graphs for- 1 August 2011
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 37, 291-296
Hamiltonian Cycles in Kneser Graphs for- 12 November 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (3) , 177-188
On hamiltonian cycles in the prism over the odd graphs
- 12 November 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (3) , 177-188
On hamiltonian cycles in the prism over the odd graphs
- Open Access
- 1 January 2009
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 3 (2) , 386-394
Hamiltonian paths in odd graphs
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.
- 1 January 2009
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 3 (2) , 386-394
Open AccessHamiltonian paths in odd graphs
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.