Abstract: This paper improves Itai and Rodeh's algorithm for finding a shortest cycle in an undirected unweighted graph. Given an undirected unweighted graph G with n vertices,the algorithm can ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback