Shared mobility redefines urban transportation, offering economic and environmental
benefits by reducing pollution and urban congestion. However, in the post-pandemic era …

Günümüzde internetin yaygın kullanımıyla, bilgi kaynaklarındaki doğru bilgiye erişimi önemli
kılmaktadır. Bilgi kaynaklarının artmasıyla birlikte özgün içeriğe sahip bilgiye erişim …

In this study, the solution of the maximum flow problem in all networks that can be modeled
on bipartite graphs has been realized. The maximum flow problem refers to the maximum …

Centrality is a frequently used metric in graph theory that identifies the dominance values of
nodes. In this study, the Malatya Centrality Algorithm, which approaches graph centrality …

The Maximum Clique Problem (MCP) is an NP-hard problem that seeks to identify the
largest subgraph composed entirely of interconnected nodes in any graph. This problem is …