A space efficient method for the lowest common ancestor problem and an application to finding negative cycles

We present a method for computing ancestor information in trees. We show the method is tunable to specific applications, and compare it to other methods. Finally, we apply our procedures to the problem of finding negative cycles in sparse graphs.