On minimum bisection and related partition problems in graphs with bounded tree width (2015)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/j.endm.2015.06.067
- Assunto: TEORIA DOS GRAFOS
- Keywords: Minimum Bisection; Minimum k-Section; tree decomposition
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0653
- Volume/Número/Paginação/Ano: v. 49, p. 481-488, Nov. 2015
- Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related partition problems in graphs with bounded tree width. 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.2015.06.067. Acesso em: 23 jan. 2026. , 2015 -
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.067 -
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2026 jan. 23 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067 -
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2026 jan. 23 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067 - On edge-magic labelings of forests
- 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
- This volume contains the papers presented at LAGOS 2023, the XII Latin-American Algorithms, Graphs and Optimization Symposium. [Prefácio]
- Approximation algorithms for the max-buying problem with limited supply
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- Transversals of longest paths
- Trajectory clustering of points in R
- Procedia Computer Science
Informações sobre o DOI: 10.1016/j.endm.2015.06.067 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
