Skip to main content
. 2012 Jun 9;28(12):i49–i58. doi: 10.1093/bioinformatics/bts212

Fig. 3.

Fig. 3.

An example with O(n2k) dummy nodes. (a) The graph. Each bold arrow represents k−1 paths. (b) The pseudo tree. The red box contains total (k−1)q dummy nodes in the paths from S to Aq−1