(5) and Algorithm 1, we can see that each hyper-edge pair ( 1 , 2 ) is only visited at most one time in computing the forest kernel.
the time complexity for computing 1 , 2 is (| 1 | • | 2 |) , where 1 and 2 are the set of hyper-edges in forests 1 and 2 , respectively.