Zobrazit v EDS

Applications of Discrete Mathematics in Computer Science: Algorithms, Graph Theory, and Beyond

Uloženo v:
Podrobná bibliografie
Název: Applications of Discrete Mathematics in Computer Science: Algorithms, Graph Theory, and Beyond
Autoři: null R. Vinodhini
Zdroj: Communications on Applied Nonlinear Analysis. 32:210-220
Informace o vydavateli: Science Research Society, 2025.
Rok vydání: 2025
Popis: Discrete mathematics has a central importance in the fundamental parts of the theory of computers. From the development of powerful algorithms to graph theory and optimization of networks discrete mathematics plays a role in the analysis and solution of computational problems. This paper aims to look at how discrete mathematics encompasses algorithms and graph theory within today’s real-world problems. As such, the study looks at how the concept of calculus in sets, relations, combinatory, and logic as fundamental blocks towards algorithm development or optimization forms the basis for growth within the field of computer science. Thus, discussing the recent changes and case studies the paper demonstrates that discrete mathematics is indeed a vital domain in computational research and its advancements’ applicability in such areas of study as data structures, network analysis, and computational complexity.
Druh dokumentu: Article
ISSN: 1074-133X
DOI: 10.52783/cana.v32.3378
Přístupové číslo: edsair.doi...........956475eef1d9da78103b5f508775a930
Databáze: OpenAIRE
Popis
Abstrakt:Discrete mathematics has a central importance in the fundamental parts of the theory of computers. From the development of powerful algorithms to graph theory and optimization of networks discrete mathematics plays a role in the analysis and solution of computational problems. This paper aims to look at how discrete mathematics encompasses algorithms and graph theory within today’s real-world problems. As such, the study looks at how the concept of calculus in sets, relations, combinatory, and logic as fundamental blocks towards algorithm development or optimization forms the basis for growth within the field of computer science. Thus, discussing the recent changes and case studies the paper demonstrates that discrete mathematics is indeed a vital domain in computational research and its advancements’ applicability in such areas of study as data structures, network analysis, and computational complexity.
ISSN:1074133X
DOI:10.52783/cana.v32.3378