Intersection of longest paths in a graph (2011)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1016/j.endm.2011.10.024
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0635
- Volume/Número/Paginação/Ano: v. 38, p. 743-748, 2011
- Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
REZENDE, Susanna F. de et al. Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2011.10.024. Acesso em: 23 abr. 2024. , 2011 -
APA
Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2011). Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.10.024 -
NLM
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024 -
Vancouver
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024 - Approximating a class of combinatorial problems with rational objective function
- Approximating rational objectives is as easy as approximating linear ones
- A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Selfish square packing
- Intersecting longest paths
- Prices of anarchy of selfish 2D bin packing games
- Repetition-free longest common subsequence
- Repetition-free longest common subsequence
- A polyhedral investigation of the LCS problem and a repetition-free variant
Informações sobre o DOI: 10.1016/j.endm.2011.10.024 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
