Treewidth Decomposition Visualizer

The tool is designed to provide a window to run the treewidth decomposition algorithm in an accessible web environment and help the user to identify insights between the decomposed tree and the original graph and visualize the relationship through interactive methods.

Algorithm Description

A treewidth graph decomposition algorithm is a method used to transform a graph into a tree-like structure known as a tree decomposition. This decomposition organizes the graph into interconnected groups of vertices (often called "bags") that satisfy three main properties:

1. Every graph vertex appears in at least one bag.
2. Every edge of the graph is contained within at least one bag.
3. For any given vertex, the bags containing that vertex form a connected subtree.

Graph and result format are referenced from PACE 2016

The algorithm used is modified from mrprajesh

Testing datasets can be found at repo

Complicated graphs will take longer time to decompose.