|Subject:||Re: [igraph] Longest path algorithm in igraph?|
|Date:||Mon, 18 Jul 2011 13:45:48 +0300|
Yes, this is exactly what I mean. In the meantime, I've been thinking on bivonnectivity and cuts as a possible approach to answer this question.
|[Prev in Thread]||Current Thread||[Next in Thread]|