Minimum t-spanners on subcubic graphs (2022)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-030-96731-4_30
- Subjects: TEORIA DOS GRAFOS; APROXIMAÇÃO POR POLINÔMIOS
- Keywords: spanner; sparse spanner; tree spanner; subcubic graph; polyhedra
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Conference and Workshops on Algorithms and Computation - WALCOM
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Minimum t-spanners on subcubic graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-96731-4_30. Acesso em: 21 jan. 2026. -
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Minimum t-spanners on subcubic graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-96731-4_30 -
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2026 jan. 21 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30 -
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2026 jan. 21 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30 - Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Grafos e otimização combinatória
- Hypotraceable digraphs
- Some approximation results for the maximum agreement forest problem
- The maximum agreement forest problem: approximation algorithms and computational experiments
- The 2-Decomposition Conjecture for a new class of graphs
- An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
Informações sobre o DOI: 10.1007/978-3-030-96731-4_30 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
