https://github.com/seemanne/1planartester

Python implementation of a 1-planarity test
https://github.com/seemanne/1planartester

1-planarity algorithm graph graph-algorithms graph-theory

Last synced: about 2 hours ago
JSON representation

Python implementation of a 1-planarity test

• Host: GitHub
• URL: https://github.com/seemanne/1planartester
• Owner: seemanne
• License: gpl-3.0
• Created: 2022-04-20T16:14:04.000Z (over 2 years ago)
• Default Branch: master
• Last Pushed: 2022-05-27T12:14:31.000Z (over 2 years ago)
• Last Synced: 2024-04-24T08:07:55.593Z (7 months ago)
• Topics: 1-planarity, algorithm, graph, graph-algorithms, graph-theory
• Language: Python
• Homepage:
• Size: 52.7 KB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# 1PlanarTester

A Python implementation of the algorithm to test and embedd 1-planar graphs as described in the paper of Binucci et al. "An Experimental Study of a 1-Planarity Testing and Embedding Algorithm" https://doi.org/10.1007/978-3-030-39881-1_28 using the python networkx library as a basis. The scope of the algorithm has extended somewhat.  

OnePlanarTester.py implements the algorithm of Binucci et al. with minor changes in how the induced edges are computed (Our implementation mainly removes non-induced edges as this has low complexity for nodes deep into the search tree)

MaxOnePlanarTester.py tests whether a given graph is maximal 1-planar by checking whether one could add any edge while keeping the graph one planar.