Approximation results on balanced connected partitions of graphs (2004)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1016/j.endm.2004.06.033
- Assunto: ALGORITMOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Electronic Notes in Discrete Mathematics
- Volume/Número/Paginação/Ano: v. 18, p. 207-212, 2004
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
SALGADO, Liliane Rose Benning; WAKABAYASHI, Yoshiko. Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics, Amsterdam, v. 18, p. 207-212, 2004. Disponível em: < https://doi.org/10.1016/j.endm.2004.06.033 > DOI: 10.1016/j.endm.2004.06.033. -
APA
Salgado, L. R. B., & Wakabayashi, Y. (2004). Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics, 18, 207-212. doi:10.1016/j.endm.2004.06.033 -
NLM
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.Available from: https://doi.org/10.1016/j.endm.2004.06.033 -
Vancouver
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.Available from: https://doi.org/10.1016/j.endm.2004.06.033 - Some approximation results for the maximum agreement forest problem
- Note on a min-max conjecture of Woodall
- The present volume is a tribute to Imre Simon, on the occasion of his 60th birthday. [Preface]
- Cutting plane algorithm for a clustering problem
- An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
- Circuit covers in series-parallel mixed graphs
- Parametric on-line packing
- The complexity of computing medians of relations
- Convex recoloring of paths
- The k-hop connected dominating set problem: hardness and polyhedra
Informações sobre o DOI: 10.1016/j.endm.2004.06.033 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
