Procedia Computer Science (2023)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- Assunto: CIÊNCIA DA COMPUTAÇÃO
- Language: Inglês
- Imprenta:
- Source:
- ISSN: 1877-0509
- Volume/Número/Paginação/Ano: v. 223, p. 1-408, 2023
- Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS
-
ABNT
RAJSBAUM, Sergio. Procedia Computer Science. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C. Acesso em: 27 abr. 2024. , 2023 -
APA
Rajsbaum, S. (2023). Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C -
NLM
Rajsbaum S. Procedia Computer Science [Internet]. 2023 ; 223 1-408.[citado 2024 abr. 27 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C -
Vancouver
Rajsbaum S. Procedia Computer Science [Internet]. 2023 ; 223 1-408.[citado 2024 abr. 27 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/223/suppl/C - 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
- Independent dominating sets in planar triangulations
- On edge-magic labelings of forests
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- 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
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas