Lataa...
A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH
We consider two options for a particle’s entire journey through a cer- tain directed graph. Both options involve a random assignment to the jour- ney route to be followed. We are interested in the option that offers, on average, the shortest route. Therefore, we determine the average journey length...
Tallennettuna:
| Julkaisussa: | Revista de Matemática: Teoría y Aplicaciones |
|---|---|
| Päätekijät: | , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Universidad de Costa Rica
2016
|
| Aiheet: | |
| Linkit: | https://www.redalyc.org/articulo.oa?id=45349329005 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|