Java implementation of algorithms to solve the Graph Thickness problem. Includes edge partitioning and planarity testing for complex network analysis.
-
Updated
Mar 23, 2026 - Java
Java implementation of algorithms to solve the Graph Thickness problem. Includes edge partitioning and planarity testing for complex network analysis.
Dr. Gethner announced that we will work in teams to create algorithms to determine graph thickness. This is where we should store our work.
Add a description, image, and links to the graph-thickness topic page so that developers can more easily learn about it.
To associate your repository with the graph-thickness topic, visit your repo's landing page and select "manage topics."