So I'm sure this is an unusual question for this type of site, but I am to give a talk on algorithms for discrete graphs in a few weeks. It has been specified that the talk is to be on some algorithm which will be unfamiliar for those attending. It it to be some graph traversal algorithm at about the junior level. Does anyone know of any such algorithm which is a bit removed from main stream graph theory?

  • 1
    $\begingroup$ What are the students supposed to learn from this algorithm? For example, you could do a random walk of the graph. Does this help in their understanding? BFS and DFS are common. There's also search algorithms that could do a traversal. $\endgroup$ – ryan Apr 9 at 19:46
  • $\begingroup$ We don't have a strict policy for list questions, but there is a general dislike. Please note also this and this discussion; you might want to improve your question as to avoid the problems explained there. $\endgroup$ – dkaeae Apr 10 at 8:59

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.