Outer 1-Planar Graphs

A graph is outer 1-planar ( o1p ) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time, and specialize 1-planar graphs, whose recognition is N P -hard. We e...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 74; no. 4; pp. 1293 - 1320
Main Authors:	Auer, Christopher, Bachmaier, Christian, Brandenburg, Franz J., Gleißner, Andreas, Hanauer, Kathrin, Neuwirth, Daniel, Reislhuber, Josef
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2016 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Mathematics of Computing Recognition Theory of Computation Visibility Graph parameters Embeddings and drawings Density Planar and outerplanar graphs 1-Planarity
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!