Recursive Algorithms for Generation of Planar Graphs
In this thesis we introduce recursive algorithms for generation of two families of plane graphs. These algorithms start with small graphs and iteratively convert them to larger graphs. The families studied in this thesis are k-angulations (plane graphs with whose faces are of size k) and plane graphs with a given face size sequence.We also design a very fast method for canonical embedding and isomorphism rejection of plane graphs. Most graph generators like plantri generate graphs up to...[Show more]
|Collections||Open Access Theses|
|Access Rights:||Open Access|
|b37556915_Jooyandeh_M.pdf||11.72 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.