An experimental study of a 1-planarity testing and embedding algorithm

DOI10.1007/978-3-030-39881-1_28MaRDI QIDQ782206zbMATH OpenOpenAlexFDO

Authors Carla Binucci, Walter Didimo, Fabrizio Montecchiani

Publication date 22 July 2020

Full work available at URL https://arxiv.org/abs/1911.00573

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• 1-planarity testing and embedding: an experimental study
• Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)
• A linear-time algorithm for testing outer-1-planarity
• A linear-time algorithm for testing outer-1-planarity

Cited in

(3)

• Edge Partitions and Visibility Representations of 1-planar Graphs
• Practical Experience with Hanani-Tutte for Testing c-Planarity
• 1-planarity testing and embedding: an experimental study

This page was built for publication: An experimental study of a 1-planarity testing and embedding algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782206)