Please use this identifier to cite or link to this item:
http://dspace.univ-tiaret.dz:80/handle/123456789/13445
Title: | The automatic solver in graph theory "Application of Eulerian chain |
Authors: | BOUZID, Asmaa MEBROUK, Yacine |
Keywords: | graph first in-depth search latex Eulerian |
Issue Date: | 11-يول-2023 |
Publisher: | Ibn Khaldoun University |
Abstract: | Graph theory has been an active field of research for 200 years. The oldest known paper on graph theory was written by Euler in 1736 to solve the Konigsberg bridge problem. In this work, we studied the automatic solver in graph theory " Eulerian chain". After explaining some basics about graphs and the problem of this chain. We cited the fundamental relations to the Eulerian chain, the latex command and then we presented the "first depth-search algorithm" and these last two that we used in the application. Finally, we presented an application to the Eulerian chain. |
URI: | http://dspace.univ-tiaret.dz:80/handle/123456789/13445 |
Appears in Collections: | Master |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
TH.M.INF.2023.12.pdf | 1,88 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.