Pablo Romero. Most reliable two-terminal graphs with distance constraints. // Procedia Computer Science. – 2025. – DOI: 10.1016/j.procs.2025.10.297. – URL: https://doi.org/10.1016/j.procs.2025.10.297
Pablo Romero (2025). Most reliable two-terminal graphs with distance constraints. Procedia Computer Science. https://doi.org/10.1016/j.procs.2025.10.297
Pablo Romero. “Most reliable two-terminal graphs with distance constraints.” Procedia Computer Science, 2025. doi:10.1016/j.procs.2025.10.297.
@article{Romero2025,
title = {Most reliable two-terminal graphs with distance constraints},
author = {Romero, Pablo},
journal = {Procedia Computer Science},
year = {2025},
doi = {10.1016/j.procs.2025.10.297},
url = {https://doi.org/10.1016/j.procs.2025.10.297}
}