Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/s0196-6774(03)00073-7
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Algorithms
- ISSN: 0196-6774
- Volume/Número/Paginação/Ano: v. 48, n. 2, p. 333-359, 2003
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 18 set. 2024. -
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7 -
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 set. 18 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7 -
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 set. 18 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7 - Kinetic clustering of points on the line
- Independent dominating sets in planar triangulations
- On edge-magic labelings of forests
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- A better approximation algorithm for finding planar subgraphs
- Questões algorítmicas de natureza combinatória
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Maximum series-parallel subgraph
- Stability in geodesics for memoryless binary long-lived consensus
Informações sobre o DOI: 10.1016/s0196-6774(03)00073-7 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas