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
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0653
- Volume/Número/Paginação/Ano: v. 18, p. 207-212, 2004
- Conference titles: Latin-American Conference on Combinatorics,Graphs and Applications
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
SALGADO, Liliane Rose Benning e WAKABAYASHI, Yoshiko. Approximation results on balanced connected partitions of graphs. 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.2004.06.033. Acesso em: 10 jan. 2026. , 2004 -
APA
Salgado, L. R. B., & Wakabayashi, Y. (2004). Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. 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.[citado 2026 jan. 10 ] 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.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033 - Convex recoloring of paths
- On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Hardness and inapproximability of convex recoloring problems
- Polynomial-time approximation schemes for circle packing problems
- Sobre grafos hamiltonianos
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Polyhedral and computational results on the k-hop connected dominating set problem
- Facets of the clique partitioning polytope
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- The maximum agreement forest problem: approximation algorithms and computational experiments
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
