Veuillez utiliser cette adresse pour citer ce document :
http://dspace.univ-tiaret.dz:80/handle/123456789/13445Affichage complet
| Élément Dublin Core | Valeur | Langue |
|---|---|---|
| dc.contributor.author | BOUZID, Asmaa | - |
| dc.contributor.author | MEBROUK, Yacine | - |
| dc.date.accessioned | 2023-10-18T13:21:32Z | - |
| dc.date.available | 2023-10-18T13:21:32Z | - |
| dc.date.issued | 2023-07-11 | - |
| dc.identifier.uri | http://dspace.univ-tiaret.dz:80/handle/123456789/13445 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Ibn Khaldoun University | en_US |
| dc.subject | graph | en_US |
| dc.subject | first in-depth search | en_US |
| dc.subject | latex | en_US |
| dc.subject | Eulerian | en_US |
| dc.title | The automatic solver in graph theory "Application of Eulerian chain | en_US |
| dc.type | Thesis | en_US |
| Collection(s) : | Master | |
Fichier(s) constituant ce document :
| Fichier | Description | Taille | Format | |
|---|---|---|---|---|
| TH.M.INF.2023.12.pdf | 1,88 MB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.