Daniel Tubbenhauer on An Almost Incredible Algortihm

He is hopefully going to be able to do a video explaining this algorithm. It's in Bojan Mohar's paper A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. See also Wendy Myrvold and William Kocay Errors in graph embedding algorithms and I. S. Filotti, Gary L. Miller and John Reif On determining the genus of a graph in O(v^O(g)) steps (Preliminary Report).

Subscribe to VisualMath.

Comments

Popular posts from this blog

David Turner Obituary by Sarah Nicholas Fri 24 Nov 2023

Live Science - Leonardo da Vinci's Ancestry