ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A Linear Time Planarity Algorithm for 2-Complexes
Full text PdfPdf (483 KB)
Source Journal of the ACM (JACM) archive
Volume 26 ,  Issue 4  (October 1979) table of contents
Pages: 611 - 617  
Year of Publication: 1979
ISSN:0004-5411
Authors
Jonathan L. Gross  Department of Computer Science, Columbia University, New York, NY
Ronald H. Rosen  Department of Mathematics, University of Michigan, Ann Arbor, MI
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 22,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322154.322156
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GRoss, J L, Ar~O ROSEN, R H A combinatorial charactenzauon of planar 2-complexes. To appear m Colloq Math
 
2
HARARY, F, AND ROSEN, R H On the plananty of2-complexes Colloq Math 36 (1976), 101-108
3
John Hopcroft , Robert Tarjan, Efficient Planarity Testing, Journal of the ACM (JACM), v.21 n.4, p.549-568, Oct. 1974  [doi>10.1145/321850.321852]
 
4
KURATOWSKI, K Surle probleme des courbes gauches en topologte Fund Math 15 (1930), 271-283

CITED BY  2
Merrick L. Furst , Jonathan L. Gross , Lyle A. McGeoch, Finding a maximum-genus graph imbedding, Journal of the ACM (JACM), v.35 n.3, p.523-534, July 1988
Hristo Djidjev , John Reif, An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.337-347, May 05-08, 1991, New Orleans, Louisiana, United States

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures


General Terms:
Algorithms, Performance, Theory

Collaborative Colleagues:
Jonathan L. Gross: colleagues
Ronald H. Rosen: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player