The minimum vertex-cover problem (MVCP) is an NP-complete optimization problem widely
used in areas such as graph theory, social network, security and transportation, etc. Different …

In biomedicine, the expansive scientific literature combined with the frequent use of
abbreviations, acronyms, and symbols presents considerable challenges for text processing …

Graph structure is widely used to describe problems in different fields. Problems in many
areas, such as security and transportation, are among them. The problems can be solved …

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 …

With the advancement of the internet, humanity has gained easy access to a plethora of
information. However, to access accurate content, numerous texts and sources must be …

The dominating set problem in graph theory is an NP-complete problem for an arbitrary
graph. There are many approximation-based studies in the literature to solve the dominating …

The Minimum Vertex Cover (MVC) problem is an important optimization problem in graph
theory. It aims to find a node set that contains the least number of nodes in a given graph …