Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (2009)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1016/j.dam.2007.10.032
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Discrete Applied Mathematics
- ISSN: 0166-218X
- Volume/Número/Paginação/Ano: v 157, n. 2, p. 272-279, 2009
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: hybrid
- Licença: publisher-specific-oa
-
ABNT
FERNANDES, Cristina Gomes e LEE, Orlando e WAKABAYASHI, Yoshiko. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, n. 2, p. 272-279, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2007.10.032. Acesso em: 28 mar. 2024. -
APA
Fernandes, C. G., Lee, O., & Wakabayashi, Y. (2009). Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, ( 2), 272-279. doi:10.1016/j.dam.2007.10.032 -
NLM
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2024 mar. 28 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032 -
Vancouver
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2024 mar. 28 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032 - Approximating a class of combinatorial problems with rational objective function
- Intersection of longest paths in a graph
- Approximating rational objectives is as easy as approximating linear ones
- A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
- Selfish square packing
- Intersecting longest paths
- Prices of anarchy of selfish 2D bin packing games
- A polyhedral investigation of the LCS problem and a repetition-free variant
- Repetition-free longest common subsequence
- Repetition-free longest common subsequence
Informações sobre o DOI: 10.1016/j.dam.2007.10.032 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas