Advertisement
Guest User

Untitled

a guest
Aug 30th, 2015
130
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.54 KB | None | 0 0
  1. Enumeration of the elementary circuits of a directed graph
  2. R. Tarjan, SIAM Journal on Computing, 2 (1973), pp. 211-216
  3. http://dx.doi.org/10.1137/0202017
  4.  
  5. Finding all the elementary circuits of a directed graph.
  6. D. B. Johnson, SIAM Journal on Computing 4, no. 1, 77-84, 1975.
  7. http://dx.doi.org/10.1137/0204007
  8.  
  9. Enumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs.
  10. Hawick and H.A. James, In Proceedings of FCS. 2008, 14-20
  11. www.massey.ac.nz/~kahawick/cstn/013/cstn-013.pdf
  12. http://complexity.massey.ac.nz/cstn/013/cstn-013.pdf
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement