A carregar...
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...
Na minha lista:
| Publicado no: | Revista de Matemática: Teoría y Aplicaciones |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Universidad de Costa Rica
2016
|
| Assuntos: | |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=45349329005 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|