# Planarity testing

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Algorithmica
- 2016

In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,Â E) and aâ€¦Â (More)

Is this relevant?

2013

2013

- Handbook of Graph Drawing and Visualization
- 2013

Universitaâ€™ di Roma Tre 3.1 Properties and Characterizations of Planar Graphs . . . . . 2 Basic Definitions â€¢ Propertiesâ€¦Â (More)

Is this relevant?

2012

2012

- Graph Drawing
- 2012

A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all edges are drawn as curves withâ€¦Â (More)

Is this relevant?

2007

2007

- Graph Drawing
- 2007

In this paper we introduce cyclic level planar graphs, which are a planar version of the recurrent hierarchies from Sugiyama etâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- SIAM J. Comput.
- 2001

A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in theâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- SIAM J. Comput.
- 1996

The on-line planarity-testing problem consists of performing the following operations on a planar graph G: (i) testing if a newâ€¦Â (More)

Is this relevant?

1989

1989

- J. ACM
- 1989

Using hierarchical definitions, one can describe very large graphs in small space. The blow-up from the length of theâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- J. Comput. Syst. Sci.
- 1985

This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based onâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- J. Comput. Syst. Sci.
- 1976

A data structure called a PQ-tree is introduced. PQ-trees can be used to represent the permutations of a set U in which variousâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- J. ACM
- 1974

This paper describes an efficient algorithm to determine whether an arbitrary graph <italic>G</italic> can be embedded in theâ€¦Â (More)

Is this relevant?