A concurrent implementation of skip graphs (2009)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/j.endm.2009.11.043
- Subjects: TEORIA DOS GRAFOS; ALGORITMOS
- Keywords: algorithms and data structures; analysis of algorithms; concurrency; skip graphs; randomized algorithms
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0653
- Volume/Número/Paginação/Ano: v. 35, p. 263-268, 2009
- Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
MENDES, Hammurabi e FERNANDES, Cristina Gomes. A concurrent implementation of skip graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2009.11.043. Acesso em: 31 dez. 2025. , 2009 -
APA
Mendes, H., & Fernandes, C. G. (2009). A concurrent implementation of skip graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2009.11.043 -
NLM
Mendes H, Fernandes CG. A concurrent implementation of skip graphs [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 263-268.[citado 2025 dez. 31 ] Available from: https://doi.org/10.1016/j.endm.2009.11.043 -
Vancouver
Mendes H, Fernandes CG. A concurrent implementation of skip graphs [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 263-268.[citado 2025 dez. 31 ] Available from: https://doi.org/10.1016/j.endm.2009.11.043 - 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
- Geodesic stability for memoryless binary long-lived consensus
- Approximation algorithms for the Max-Buying problem with limited supply
- Nonempty intersection of longest paths in series-parallel graphs
- The online multicommodity connected facility location problem
- Complexity and approximability of minimum path-collection exact covers
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Informações sobre o DOI: 10.1016/j.endm.2009.11.043 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3032488.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
