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 focusin...

Full description

Saved in:
Bibliographic Details
Published in:Suid-Afrikaanse tydskrif vir natuurwetenskap en tegnologie 2016-01, Vol.35 (1), p.1-2
Main Authors: Van der Linde, J.J., Sanders, I.D.
Format: Article
Language:Afrikaans
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0254-3486
2222-4173
DOI:10.4102/satnt.v35i1.1407