The graph genus problem is NP-complete
Journal of Algorithms
Isomorph-free exhaustive generation
Journal of Algorithms
Hi-index | 0.00 |
An inductive definition of the class of all cubic toroidal maps will be given. Moreover, it will be demonstrated how this definition can be used to develop an efficient algorithm which constructs all cubic toroidal maps with a limited number of vertices.