Ryan Williams Finding paths of length k in O<sup>*</sup>(2<sup>k</sup>) time. 315-318 2009 109 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2008.11.004 db/journals/ipl/ipl109.html#Williams09