登入選單
返回Google圖書搜尋
Detecting Cycles Through Three Fixed Vertices in a Graph
註釋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."