Die vergroting van gerigte grafieke om te verseker dat alle nodusse in siklusse voorkom : referaatopsomming

Enlarging directed graphs to ensure that all nodes are contained in cycles This research expands on previous research into a graph-matching problem, known as the 'shoe-matching problem', and the role of a graph-enlargement algorithm in finding this solution. Multiple new algorithms focusing on graph enlargement and the shoe-matching problem are presented with positive results overall.