Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. Bijective combinatorial methods in comparison of optimal algorithms;Bloom,1992
2. An O(m log n)-time algorithm for the maximal planar subgraph problem;Cai;SIAM J. Comput.,1993
3. The two basic linear time planarity algorithms: are they the same?;Canfield;Linear and Multilinear Algebra,1990
4. Efficient planarity testing;Hopcroft;J. ACM,1974
5. An algorithm for planarity testing of graphs;Lempel,1967