Abstract
We present a simple linear time algorithm for finding a cycle through three fixed vertices in an undirected graph. The algorithm is based on decompositions into triconnected components and on a combinatorial result of Lovász.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have