Cite
Fast Enumeration Algorithms for Non-crossing Geometric Graphs
MLA
Katoh, N., and S. Tanigawa. Fast Enumeration Algorithms for Non-Crossing Geometric Graphs. 2008. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1389668840&authtype=sso&custid=ns315887.
APA
Katoh, N., & Tanigawa, S. (2008). Fast Enumeration Algorithms for Non-crossing Geometric Graphs.
Chicago
Katoh, N, and S Tanigawa. 2008. “Fast Enumeration Algorithms for Non-Crossing Geometric Graphs.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1389668840&authtype=sso&custid=ns315887.