Efficient Planarity Testing-Reference-Cited by-同舟云学术

Efficient Planarity Testing

Published:1974-10 Issue:4 Volume:21 Page:549-568
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Hopcroft John¹,Tarjan Robert²

Affiliation:

1. Department of Computer Science, Cornell University, Ithaca, New York

2. Department of Electrical Engineering, University of California, Berkeley, CA and Cornell University, Ithaca, New York

Abstract

This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm used depth-first search and has O ( V ) time and space bounds, where V is the number of vertices in G . An ALGOL implementation of the algorithm succesfully tested graphs with as many as 900 vertices in less than 12 seconds.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321850.321852

Reference41 articles.

1. Backtrack Programming

2. Algorithm 447: efficient algorithms for graph manipulation

Cited by 741 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A fast detection method to solve mechanical interference problem in automatic transmission;Mechanism and Machine Theory;2023-11

2. VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21

3. Finding strong components using depth-first search;European Journal of Combinatorics;2023-10

4. Grid recognition: Classical and parameterized computational perspectives;Journal of Computer and System Sciences;2023-09

5. Arkhipov’s theorem, graph minors, and linear system nonlocal games;Algebraic Combinatorics;2023-08-29