%0 Journal Article
%T Matbase DFS Detecting and Classifying E-RD Cycles Algorithm
%A Adrian Mocanu
%A Christian Mancas
%J Journal of Computer Science Applications | Computer Science Impact Factor Journals
%D 2017
%R 10.15226/2474-9257/2/4/00123
%X A Depth First Search type algorithm for detecting and classifying all cycles of a directed graph was designed and implemented in MatBase for database Entity-Relationship Diagrams. Its time complexity, optimality, and utility for teaching both graph theory, sets, functions, and relations algebra, as well as, especially, for database non-relational constraints discovery and enforcement are discussed and exemplified with real world examples. CCS Concepts £¿ Information systems~Entity relationship models £¿ Theory of computation~Dynamic graph algorithms £¿ Theory of computation~Data modeling £¿ Theory of computation~Database constraints theory £¿ Applied computing~Computer-assisted instruction Keywords: (Elementary) Mathematical Data Model; MatBase; Depth First Search
%U https://symbiosisonlinepublishing.com/computer-science-technology/computerscience-information-technology23.php