GitHub / diogorrio / discovering_fm_for_treewidth
Project code developed to accompany the thesis of the bachelor programme BSc Data Science and Artificial Intelligence, taught by Universiteit Maastricht. It consists in (re-)discovering Forbidden Minors for Treewidth, through a series of graph search/analysis techniques.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diogorrio%2Fdiscovering_fm_for_treewidth
PURL: pkg:github/diogorrio/discovering_fm_for_treewidth
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 323 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: about 2 years ago
Pushed at: about 2 years ago
Last synced at: about 2 years ago
Topics: exhaustiveness-checking, f4, f5, forbidden-minors, graph-theory-algorithms, pruning-algorithms, thesis, treewidth