<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Reachability - Page 12 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Reachability&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Reachability&amp;p=13">3.Next</a>
</p>
<p>components which each contain at most  the vertices of the original. As  is built from two layers of opposed dipaths, each separator may consist of up to 2 dipaths, for a total of up to 6 dipaths over all of the separators. Let  be this set of dipaths. The proof that such separators can always be found is related to the <a href="page.php?w=Planar_Separator_Theorem">Planar Separator Theorem</a> of Lipton and Tarjan, and these separators can be located in linear time.</p>

<p>For each , the directed nature of  provides for a natural indexing of</p><p>
<a accesskey="1" href="page.php?w=Reachability&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Reachability&amp;p=13">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
