Elsevier

Journal of Algorithms

Volume 5, Issue 3, September 1984, Pages 375-390
Journal of Algorithms

Gauss codes, planar hamiltonian graphs, and stack-sortable permutations

https://doi.org/10.1016/0196-6774(84)90018-XGet rights and content

Abstract

In this paper the following three recognition problems are considered: (1) Test whether a given sequence is the Gauss code of a planar self-intersecting curve; (2) test whether a given graph with a known Hamiltonian cycle is planar; and (3) test whether a given permutation can be sorted using two stacks in parallel. These three problems are closely related: A simple linear-time algorithm that solves all three is described. The heart of the algorithm is a data structure, previously used in general planarity testing, called a pile of twin stacks.

References (12)

There are more references available in the full text version of this article.

Cited by (33)

View all citing articles on Scopus
View full text