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 graph theory is one of the fundamental structures in computer science used to model
various scientific and engineering problems. Many problems within the graph theory are …

With the advancement of Internet technology and social network, a multitude of real-world
issues can be modeled as combinatorial optimization problems on networks, attracting …

This paper presents a novel algorithm for the Vertex Cover problem, inspired by the Think-
Like-A-Vertex (TLAV) paradigm. The Vertex Cover problem, a fundamental challenge in …

This study aims to identify sensor network devices located in areas of high connection
density within a network. By doing so, it will be possible to determine regions with dense and …

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 …

With the increasing attention and investments drawn to the Quantum Computing field, a
number of different technologies and multiple algorithms have emerged in an effort to study …

With the advancement of Internet technology and social network, a multitude of real-world
issues can be modeled as combinatorial optimization problems on networks, attracting …

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 …