Marek Sokołowski

boyer_myrvold_planarity_test: Apparent quadratic time complexity for prism graphs

1

The Boyer-Myrvold planarity test for [prism graphs](https://en.wikipedia.org/wiki/Prism_graph) appears to run in quadratic time complexity: ``` c++ #include #include #include #include using namespace std; using namespace boost; // Follows libs/graph/example/simple_planarity_test.cpp. using...