|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
February 1975 (vol. 24 no. 2)
pp. 113-121
| ASCII Text | x | ||
| F. Rubin, "An Improved Algorithm for Testing the Planarity of a Graph," IEEE Transactions on Computers, vol. 24, no. 2, pp. 113-121, February, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224179, author = {F. Rubin}, title = {An Improved Algorithm for Testing the Planarity of a Graph}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {2}, issn = {0018-9340}, year = {1975}, pages = {113-121}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224179}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Improved Algorithm for Testing the Planarity of a Graph IS - 2 SN - 0018-9340 SP113 EP121 EPD - 113-121 A1 - F. Rubin, PY - 1975 KW - Graph theory KW - imbedding KW - planar graphs KW - planar representations KW - printed circuits. VL - 24 JA - IEEE Transactions on Computers ER - | |||
Hopcroft and Tarjan [2] have recently proposed an algorithm that runs in linear time for testing the planarity of a graph. The technique finds a representation of the graph as a sequence of paths and then iteratively imbeds these paths to find a mesh structure, rearranging the meshes as needed to accommodate each new path. Demoucron et al. [1] have shown that this rearrangement process is unnecessary if the paths are considered in the proper order. The present implementation is found to run in linear time for most ordinary cases, about twice as fast as Tarjan's Algol implementation. A graph of 3000 vertices and 8994 edges required about 18 s.
Index Terms:
Graph theory, imbedding, planar graphs, planar representations, printed circuits.
Citation:
F. Rubin, "An Improved Algorithm for Testing the Planarity of a Graph," IEEE Transactions on Computers, vol. 24, no. 2, pp. 113-121, Feb. 1975, doi:10.1109/T-C.1975.224179
Usage of this product signifies your acceptance of the Terms of Use.