Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (2018)
Gómez, Renzo; Wakabayashi, Yoshiko 
Fonte: Proceedings. Nome do evento: International Workshop on Graph-Theoretic Concepts in Computer Science - WG. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e WAKABAYASHI, Yoshiko. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-030-00256-5_19. Acesso em: 19 nov. 2024.APA
Gómez, R., & Wakabayashi, Y. (2018). Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-00256-5_19NLM
Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19Vancouver
Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19
