Covering a graph with nontrivial vertex-disjoint paths: existence and optimization

Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (2018)

Authors:
- Gómez, Renzo
- Wakabayashi, Yoshiko
Autor USP: WAKABAYASHI, YOSHIKO - IME
Unidade: IME
DOI: 10.1007/978-3-030-00256-5_19
Subjects: TEORIA DOS GRAFOS; OTIMIZAÇÃO COMBINATÓRIA
Agências de fomento:
Language: Inglês
Imprenta:
- Publisher: Springer
- Publisher place: Cham
- Date published: 2018
Source:
- Título do periódico: Proceedings
Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG

Informações sobre o DOI: 10.1007/978-3-030-00256-5_19 (Fonte: oaDOI API)

Tipo	Nome	Link
	2912608.pdf

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: 27 set. 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_19
NLM

Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;[citado 2024 set. 27 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19
Vancouver

Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;[citado 2024 set. 27 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19