How heavy independent sets help to find arborescences with many leaves in DAGs (2023)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/j.jcss.2023.02.006
- Subjects: ALGORITMOS DE APROXIMAÇÃO; TEORIA DOS GRAFOS; ALGORITMOS E ESTRUTURAS DE DADOS
- Keywords: Approximation algorithms; Maximum leaf spanning arborescence; Weighted independent sets; Directed acyclic graphs
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Computer and System Sciences
- ISSN: 0022-0000
- Volume/Número/Paginação/Ano: v. 135, p. 158-174, 2023
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, v. 135, p. 158-174, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.jcss.2023.02.006. Acesso em: 10 jun. 2024. -
APA
Fernandes, C. G., & Lintzmayer, C. N. (2023). How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, 135, 158-174. doi:10.1016/j.jcss.2023.02.006 -
NLM
Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006 -
Vancouver
Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Independent dominating sets in planar triangulations
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On edge-magic labelings of forests
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- 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.1016/j.jcss.2023.02.006 (Fonte: oaDOI API)
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
3128025.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas