<?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="Graph embedding - Page 13 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=graph_embedding&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_embedding&amp;p=14">3.Next</a>
</p>
<p>However, <a href="page.php?w=Wendy_Myrvold">Wendy Myrvold</a> and <a href="page.php?w=William_Lawrence_Kocay">William Kocay</a> proved in 2011 that the algorithm given by Filotti, Miller and Reif was incorrect.</p>

<p>In 1999 it was reported that the fixed-genus case can be solved in time <a href="page.php?w=linear_time">linear</a> in the graph size and <a href="page.php?w=Double_exponential_function">doubly exponential</a> in the genus.</p>

<p><big>Embeddings of graphs into higher-dimensional spaces</big></p>
<p>It is known that any finite graph can</p><p>
<a accesskey="1" href="page.php?w=graph_embedding&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_embedding&amp;p=14">3.Next</a>
</p>

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

</card>
</wml>
