APAC: An exact algorithm for retrieving cycles and paths in all kinds of graphs
This paper presents an alorithm for retrieving all paths and all cycles between two vertices in random directed or undirected connected graphs. This algorithm can be easily implemented and is highly modular; with minor changes it can be adapted to obtain different parameters from the graphs. It is a...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | http://scielo.pt/scielo.php?script=sci_arttext&pid=S1645-99112009000200004 |
| País: | Portugal |
| Oai: | oai:scielo:S1645-99112009000200004 |