Document Open Access Logo

OOPS: Optimized One-Planarity Solver via SAT

Author Sergey Pupyrev

PDF

File

Thumbnail PDF
PDF
LIPIcs.GD.2025.14.pdf
  • Filesize: 1.01 MB
  • 19 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Mathematics of computing → Graph theory
Keywords
  • beyond planarity
  • 1-planar graph
  • SAT
  • book embeddings
  • upward 1-planarity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once - a natural generalization of planar graphs that has received increasing attention in graph drawing and beyond-planar graph theory. Although testing planarity can be done in linear time, recognizing 1-planar graphs is NP-complete, making effective practical algorithms especially valuable.
The core idea of our approach is to reduce the recognition of 1-planarity to a propositional satisfiability (SAT) instance, enabling the use of modern SAT solvers to efficiently explore the search space. Despite the inherent complexity of the problem, our method is substantially faster in practice than naïve or brute-force algorithms. In addition to demonstrating the empirical performance of our solver on synthetic and real-world instances, we show how OOPS can be used as a discovery tool in theoretical graph theory. Specifically, we employ OOPS to investigate two research problems concerning 1-planarity of specific graph families. Our implementation of the algorithm is publicly available to support further exploration in the field.

Cite As Get BibTex

Sergey Pupyrev. OOPS: Optimized One-Planarity Solver via SAT. In 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 357, pp. 14:1-14:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.GD.2025.14

Author Details

Sergey Pupyrev
  • Menlo Park, CA, USA

Supplementary Materials

References

  1. Michael O Albertson. Chromatic number, independence ratio, and crossing number. Ars Math. Contemp., 1(1):1-6, 2008. URL: https://doi.org/10.26493/1855-3974.10.2D0.
  2. Markus Anders, Sofia Brenner, and Gaurav Rattan. Satsuma: Structure-based symmetry breaking in SAT. In Supratik Chakraborty and Jie-Hong Roland Jiang, editors, Theory and Applications of Satisfiability Testing, volume 305 of LIPIcs, pages 4:1-4:23, 2024. URL: https://doi.org/10.4230/LIPICS.SAT.2024.4.
  3. Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, and Alexander Wolff. The price of upwardness. In International Symposium on Graph Drawing and Network Visualization (GD), volume 320, pages 13:1-13:20, 2024. URL: https://doi.org/10.4230/LIPIcs.GD.2024.13.
  4. Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, and Ignaz Rutter. The price of upwardness. Discret. Math. Theor. Comput. Sci., 27(3), 2025. URL: https://doi.org/10.46298/DMTCS.15222.
  5. Christopher Auer, Christian Bachmaier, Franz J Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, and Josef Reislhuber. Outer 1-planar graphs. Algorithmica, 74(4):1293-1320, 2016. URL: https://doi.org/10.1007/S00453-015-0002-1.
  6. Christopher Auer, Franz Brandenburg, Andreas Gleißner, and Josef Reislhuber. 1-planarity of graphs with a rotation system. Journal of Graph Algorithms and Applications, 19(1):67-86, 2015. URL: https://doi.org/10.7155/JGAA.00347.
  7. Christian Bachmaier, Franz J Brandenburg, Kathrin Hanauer, Daniel Neuwirth, and Josef Reislhuber. NIC-planar graphs. Discret. Appl. Math., 232:23-40, 2017. URL: https://doi.org/10.1016/J.DAM.2017.08.015.
  8. Michael J. Bannister, Sergio Cabello, and David Eppstein. Parameterized complexity of 1-planarity. J. Graph Algorithms Appl., 22(1):23-49, 2018. URL: https://doi.org/10.7155/JGAA.00457.
  9. Michael A. Bekos, Michael Kaufmann, and Christian Zielke. The book embedding problem from a SAT-solving perspective. In Emilio Di Giacomo and Anna Lubiw, editors, Graph Drawing and Network Visualization GD, volume 9411 of Lecture Notes in Computer Science, pages 125-138. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-27261-0_11.
  10. Carla Binucci, Walter Didimo, and Fabrizio Montecchiani. 1-planarity testing and embedding: An experimental study. Comput. Geom., 108:101900, 2023. URL: https://doi.org/10.1016/J.COMGEO.2022.101900.
  11. Rainer Bodendiek, H Schumacher, and Klaus Wagner. Über 1-optimale graphen. Mathematische Nachrichten, 117(1):323-339, 1984. URL: https://doi.org/10.1002/mana.3211170125.
  12. O. V. Borodin. Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskret. Analiz., 41(108):12-26, 1984. Google Scholar
  13. Franz J. Brandenburg. Characterizing and recognizing 4-map graphs. Algorithmica, 81(5):1818-1843, 2019. URL: https://doi.org/10.1007/S00453-018-0510-X.
  14. Sergio Cabello and Bojan Mohar. Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput., 42(5):1803-1829, 2013. URL: https://doi.org/10.1137/120872310.
  15. Markus Chimani and Robert Zeranski. Upward planarity testing in practice: SAT formulations and comparative study. ACM J. Exp. Algorithmics, 20:1-27, 2015. URL: https://doi.org/10.1145/2699875.
  16. Július Czap and Dávid Hudák. 1-planarity of complete multipartite graphs. Discret. Appl. Math., 160(4-5):505-512, 2012. URL: https://doi.org/10.1016/J.DAM.2011.11.014.
  17. Július Czap and Dávid Hudák. On drawings and decompositions of 1-planar graphs. Electron. J. Comb., 20(2):54, 2013. URL: https://doi.org/10.37236/2392.
  18. Jo Devriendt and Bart Bogaerts. BreakID: Static symmetry breaking for ASP (system description). arXiv preprint arXiv:1608.08447, 2016. URL: https://arxiv.org/abs/1608.08447.
  19. Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, and David R. Wood. Improved upper bounds on the crossing number. In Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, pages 375-384. ACM, 2008. URL: https://doi.org/10.1145/1377676.1377739.
  20. Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg. Extending partial 1-planar drawings. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, International Colloquium on Automata, Languages, and Programming, LIPIcs, pages 43:1-43:19, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.43.
  21. Stefan Felsner, Éric Fusy, Marc Noy, and David Orden. Bijections for Baxter families and related objects. Journal of Combinatorial Theory, Series A, 118(3):993-1020, 2011. URL: https://doi.org/10.1016/j.jcta.2010.03.017.
  22. Simon D. Fink, Miriam Münch, Matthias Pfretzschner, and Ignaz Rutter. Heuristics for exact 1-planarity testing. In Vida Dujmović and Fabrizio Montecchiani, editors, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025), Leibniz International Proceedings in Informatics (LIPIcs), pages 4:1-4:19, Dagstuhl, Germany, 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.GD.2025.4.
  23. Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, and Daniel Štefankovič. Hanani-Tutte, monotone drawings, and level-planarity. In János Pach, editor, Thirty Essays on Geometric Graph Theory, pages 263-287. Springer, 2013. URL: https://doi.org/10.1007/978-1-4614-0110-0_14.
  24. Alexander Grigoriev and Hans L Bodlaender. Algorithms for graphs embeddable with few crossings per edge. Algorithmica, 49(1):1-11, 2007. URL: https://doi.org/10.1007/s00453-007-0010-x.
  25. Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, and Yusuke Suzuki. A linear-time algorithm for testing outer-1-planarity. Algorithmica, 72:1033-1054, 2015. URL: https://doi.org/10.1007/s00453-014-9890-8.
  26. Yuanqiu Huang, Zhangdong Ouyang, and Fengming Dong. On the sizes of bipartite 1-planar graphs. Electron. J. Comb., 28(2):2, 2021. URL: https://doi.org/10.37236/10012.
  27. Dmitri V Karpov. An upper bound on the number of edges in an almost planar bipartite graph. Journal of Mathematical Sciences, 196:737-746, 2014. URL: https://doi.org/10.1007/s10958-014-1690-9.
  28. Stephen G Kobourov, Giuseppe Liotta, and Fabrizio Montecchiani. An annotated bibliography on 1-planarity. Computer Science Review, 25:49-67, 2017. URL: https://doi.org/10.1016/j.cosrev.2017.06.002.
  29. Vladimir P Korzhik and Bojan Mohar. Minimal obstructions for 1-immersions and hardness of 1-planarity testing. Journal of Graph Theory, 72(1):30-71, 2013. URL: https://doi.org/10.1002/jgt.21630.
  30. Ludovic Le Frioux, Souheib Baarir, Julien Sopena, and Fabrice Kordon. PaInleSS: A framework for parallel SAT solving. In Theory and Applications of Satisfiability Testing, pages 233-250. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-66263-3_15.
  31. Brendan D. McKay and Adolfo Piperno. Practical graph isomorphism, ii. Journal of Symbolic Computation, 60:94-112, 2014. URL: https://doi.org/10.1016/j.jsc.2013.09.003.
  32. Martin Nöllenburg and Sergey Pupyrev. On families of planar dags with constant stack number. In Michael A. Bekos and Markus Chimani, editors, Graph Drawing and Network Visualization (GD), pages 135-151. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-49272-3_10.
  33. János Pach and Géza Tóth. Monotone drawings of planar graphs. Journal of Graph Theory, 46(1):39-47, 2004. URL: https://doi.org/10.1002/jgt.10168.
  34. Sergey Pupyrev. spupyrev/oops. Software (visited on 2025-11-07). URL: https://github.com/spupyrev/oops
    full metadata available at: https://doi.org/10.4230/artifacts.25056
  35. Sergey Pupyrev. A collection of existing results on stack and queue numbers. https://spupyrev.github.io/linearlayouts.html, 2020. Accessed: 5/23/2025.
  36. Gerhard Ringel. Ein Sechsfarbenproblem auf der Kugel. In Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, volume 29, pages 107-117. Springer, 1965. URL: https://doi.org/10.1007/BF02996313.
  37. Vincent Vallade, Ludovic Le Frioux, Razvan Oanea, Souheib Baarir, Julien Sopena, Fabrice Kordon, Saeed Nejati, and Vijay Ganesh. New concurrent and distributed painless solvers: p-mcomsps, pmcomsps-com, p-mcomsps-mpi, and p-mcomsps-com-mpi. SAT Competition, page 40, 2021. Google Scholar
  38. Licheng Zhang, Zhangdong Ouyang, and Yuanqiu Huang. Maximum degree and connectivity on claw-free 1-planar graphs, 2025. v1 accessed: 1/25/2025. URL: https://arxiv.org/abs/2501.15124.
  39. Xin Zhang. Drawing complete multipartite graphs on the plane with restrictions on crossings. Acta Mathematica Sinica, English Series, 30(12):2045-2053, 2014. URL: https://doi.org/10.1007/s10114-014-3763-6.
  40. Xin Zhang and Guizhen Liu. The structure of plane graphs with independent crossings and its applications to coloring problems. Central European Journal of Mathematics, 11:308-321, 2013. URL: https://doi.org/10.2478/s11533-012-0094-7.
  41. MapleGlucose SAT solver. https://maplesat.github.io/solvers.html, 2021.
  42. Painless SAT solver. https://www.lrde.epita.fr/wiki/Painless, 2021.
  43. nauty and Traces. https://pallini.di.uniroma1.it. Accessed: 5/23/2025.
  44. List of graphs by edges and vertices. https://en.wikipedia.org/wiki/List_of_graphs_by_edges_and_vertices. Accessed: 5/23/2025.
  45. AT&T and Rome graphs. http://graphdrawing.org/data.html. Accessed: 5/23/2025.
  46. David Eppstein. Cubic 1-planarity. https://11011110.github.io/blog/2014/05/11/cubic-1-planarity.html. Accessed: 5/23/2025.
  47. Mathematics StackExchange. Lower bound on the number of edges in a non-k-planar graph. https://math.stackexchange.com/questions/4637623. Accessed: 5/23/2025.
  48. Mathematics StackExchange. Can a 3-regular non-1-planar graph be constructed? https://mathoverflow.net/questions/441370. Accessed: 5/23/2025.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact