A Linear-Time Algorithm for Testing Outer-1-Planarity

A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. It is known that the problem of testing 1-planarity of a graph is NP-complete. In this paper, we study outer-1-planar graphs. A graph is outer-1-planar if it has an embedding in which every vertex is on the ou...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 72; číslo 4; s. 1033 - 1054
Hlavní autoři:	Hong, Seok-Hee, Eades, Peter, Katoh, Naoki, Liotta, Giuseppe, Schweitzer, Pascal, Suzuki, Yusuke
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2015
Témata:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Graph drawing 1-Planar embedding Outer 1-planar graphs 1-Planarity 1-Planar graphs
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. It is known that the problem of testing 1-planarity of a graph is NP-complete. In this paper, we study outer-1-planar graphs. A graph is outer-1-planar if it has an embedding in which every vertex is on the outer face and each edge has at most one crossing. We present a linear time algorithm to test whether a given graph is outer-1-planar. The algorithm can be used to produce an outer-1-planar embedding in linear time if it exists.
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-014-9890-8