Maximum series-parallel subgraph (2010)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-11409-0_5
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG
- 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 KAUL, Hemanshu. Maximum series-parallel subgraph. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-11409-0_5. Acesso em: 29 dez. 2025. -
APA
Calinescu, G., Fernandes, C. G., & Kaul, H. (2010). Maximum series-parallel subgraph. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-11409-0_5 -
NLM
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2025 dez. 29 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5 -
Vancouver
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2025 dez. 29 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5 - 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
- Complexity and approximability of minimum path-collection exact covers
- A concurrent implementation of skip graphs
- 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
Informações sobre o DOI: 10.1007/978-3-642-11409-0_5 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
