This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
0 then L = LN ew; Clear(LNew); k = k + 1; End While Return (L1 );
Fig. 4. Finding a longest valid adjacency path of P . L is the list of adjacency paths of size k, Lj denotes the j th path of L, and Lj [i] the ith vertex of Lj .
A preliminary preprocessing of P = (VP , EP ) is required to eﬃciently compute successive adjacency paths. 1. Create the matrix M of size |VP |×|VP | verifying, for any i, j ∈ VP , M (i, j) = 1 iﬀ i