A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH
We consider two options for a particle’s entire journey through a certaindirectedgraph. Both options involve a random assignment to the journey route to be followed. We are interested in the option that offers, on average, the shortest route. Therefore, we determine the average journey length for ea...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad de Costa Rica
2016-08-01
|
| Series: | Revista de Matemática: Teoría y Aplicaciones |
| Subjects: | |
| Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/25267 |