On edge-magic labelings of forests (2019)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/j.entcs.2019.08.027
- Assunto: TEORIA DOS GRAFOS
- Keywords: edge-magic labelings; stars; caterpillars; forests
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Theoretical Computer Science
- ISSN: 1571-0661
- Volume/Número/Paginação/Ano: v. 346, p. 299-307, 2019
- Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
CERIOLI, Márcia R et al. On edge-magic labelings of forests. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.027. Acesso em: 10 fev. 2026. , 2019 -
APA
Cerioli, M. R., Fernandes, C. G., Lee, O., Lintzmayer, C. N., Mota, G. O., & Silva, C. N. da. (2019). On edge-magic labelings of forests. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2019.08.027 -
NLM
Cerioli MR, Fernandes CG, Lee O, Lintzmayer CN, Mota GO, Silva CN da. On edge-magic labelings of forests [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 299-307.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.027 -
Vancouver
Cerioli MR, Fernandes CG, Lee O, Lintzmayer CN, Mota GO, Silva CN da. On edge-magic labelings of forests [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 299-307.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.027 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- Problemas circulatorios em grafos
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
Informações sobre o DOI: 10.1016/j.entcs.2019.08.027 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3000181.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
