An Experimental Study of a 1-planarity Testing and Embedding Algorithm
Abstract
The definition of -planar graphs naturally extends graph planarity, namely a graph is -planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time, deciding whether a graph is -planar is NP-complete, even for restricted classes of graphs. Although several polynomial-time algorithms have been described for recognizing specific subfamilies of -planar graphs, no implementations of general algorithms are available to date. We investigate the feasibility of a -planarity testing and embedding algorithm based on a backtracking strategy. While the experiments show that our approach can be successfully applied to graphs with up to 30 vertices, they also suggest the need of more sophisticated techniques to attack larger graphs. Our contribution provides initial indications that may stimulate further research on the design of practical approaches for the -planarity testing problem.
Cite
@article{arxiv.1911.00573,
title = {An Experimental Study of a 1-planarity Testing and Embedding Algorithm},
author = {Carla Binucci and Walter Didimo and Fabrizio Montecchiani},
journal= {arXiv preprint arXiv:1911.00573},
year = {2019}
}