Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/3-540-69346-7_11
- Subjects: ALGORITMOS DE APROXIMAÇÃO; TEORIA DOS GRAFOS
- Keywords: Binary Tree; Performance Ratio; Input Graph; Tree Decomposition; Unweighted Graph
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: Integer Programming and Combinatorial Optimization - IPCO
- 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. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 28 abr. 2024. -
APA
Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11 -
NLM
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/3-540-69346-7_11 -
Vancouver
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/3-540-69346-7_11 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On edge-magic labelings of forests
- Independent dominating sets in planar triangulations
- Problemas circulatorios em grafos
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
Informações sobre o DOI: 10.1007/3-540-69346-7_11 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 3033952.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
