On minimum bisection and related cut problems in trees and tree-like graphs (2018)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1002/jgt.22248
- Subjects: TEORIA DOS GRAFOS; OTIMIZAÇÃO COMBINATÓRIA
- Keywords: linear-time algorithm; minimum bisection; tree; tree decomposition
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Graph Theory
- ISSN: 0364-9024
- Volume/Número/Paginação/Ano: v. 89, n. 2, p. 214-245, 2018
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, v. 89, n. 2, p. 214-245, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22248. Acesso em: 09 jan. 2026. -
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2018). On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, 89( 2), 214-245. doi:10.1002/jgt.22248 -
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2026 jan. 09 ] Available from: https://doi.org/10.1002/jgt.22248 -
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2026 jan. 09 ] Available from: https://doi.org/10.1002/jgt.22248 - Repetition-free longest common subsequence of random sequences
- Trajectory clustering of points in R
- Approximation algorithms for the max-buying problem with limited supply
- Stability in geodesics for memoryless binary long-lived consensus
- Approximating minimum k-section in trees with linear diameter
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A new approximation algorithm for finding heavy planar subgraphs
- Maximum series-parallel subgraph
- Maximum series-parallel subgraph
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
Informações sobre o DOI: 10.1002/jgt.22248 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2883821.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
