FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4310831689> ?p ?o ?g. }

• W4310831689 abstract "The graph is a data structures and models that used to describe many real-world problems. Many engineering problems, such as safety and transportation, have a graph-like structure and are based on a similar model. Therefore, these problems can be solved using similar methods to the graph data model. Vertex cover problem that is used in modeling many problems is one of the important NP-complete problems in graph theory. Vertex-cover realization by using minimum number of vertex is called Minimum Vertex Cover Problem (MVCP). Since MVCP is an optimization problem, many algorithms and approaches have been proposed to solve this problem. In this article, Malatya algorithm, which offers an effective solution for the vertex-cover problem, is proposed. Malatya algorithm offers a polynomial approach to the vertex cover problem. In the proposed approach, MVCP consists of two steps, calculating the Malatya centrality value and selecting the covering nodes. In the first step, Malatya centrality values are calculated for the nodes in the graph. These values are calculated using Malatya algorithm. Malatya centrality value of each node in the graph consists of the sum of the ratios of the degree of the node to the degrees of the adjacent nodes. The second step is a node selection problem for the vertex cover. The node with the maximum Malatya centrality value is selected from the nodes in the graph and added to the solution set. Then this node and its coincident edges are removed from the graph. Malatya centrality values are calculated again for the new graph, and the node with the maximum Malatya centrality value is selected from these values, and the coincident edges to this node are removed from the graph. This process is continued until all the edges in the graph are covered. It is shown on the sample graph that the proposed Malatya algorithm provides an effective solution for MVCP. Successful test results and analyzes show the effectiveness of Malatya algorithm." @default.
• W4310831689 created "2022-12-19" @default.
• W4310831689 creator A5032715887 @default.
• W4310831689 creator A5043577944 @default.
• W4310831689 creator A5071765270 @default.
• W4310831689 date "2022-11-27" @default.
• W4310831689 modified "2023-10-06" @default.
• W4310831689 title "A New Approach Based on Centrality Value in Solving the Minimum Vertex Cover Problem: Malatya Centrality Algorithm" @default.
• W4310831689 cites W2056872955 @default.
• W4310831689 cites W2127387319 @default.
• W4310831689 cites W2143698439 @default.
• W4310831689 cites W2968717687 @default.
• W4310831689 cites W3041065315 @default.
• W4310831689 cites W3120973468 @default.
• W4310831689 cites W4200490568 @default.
• W4310831689 cites W4210505369 @default.
• W4310831689 cites W4224239360 @default.
• W4310831689 cites W4280612815 @default.
• W4310831689 cites W4280618382 @default.
• W4310831689 doi "https://doi.org/10.53070/bbd.1195501" @default.
• W4310831689 hasPublicationYear "2022" @default.
• W4310831689 type Work @default.
• W4310831689 citedByCount "0" @default.
• W4310831689 crossrefType "journal-article" @default.
• W4310831689 hasAuthorship W4310831689A5032715887 @default.
• W4310831689 hasAuthorship W4310831689A5043577944 @default.
• W4310831689 hasAuthorship W4310831689A5071765270 @default.
• W4310831689 hasBestOaLocation W43108316891 @default.
• W4310831689 hasConcept C11413529 @default.
• W4310831689 hasConcept C114614502 @default.
• W4310831689 hasConcept C132525143 @default.
• W4310831689 hasConcept C17762858 @default.
• W4310831689 hasConcept C28723256 @default.
• W4310831689 hasConcept C33923547 @default.
• W4310831689 hasConcept C40687702 @default.
• W4310831689 hasConcept C41008148 @default.
• W4310831689 hasConcept C53811970 @default.
• W4310831689 hasConcept C80899671 @default.
• W4310831689 hasConceptScore W4310831689C11413529 @default.
• W4310831689 hasConceptScore W4310831689C114614502 @default.
• W4310831689 hasConceptScore W4310831689C132525143 @default.
• W4310831689 hasConceptScore W4310831689C17762858 @default.
• W4310831689 hasConceptScore W4310831689C28723256 @default.
• W4310831689 hasConceptScore W4310831689C33923547 @default.
• W4310831689 hasConceptScore W4310831689C40687702 @default.
• W4310831689 hasConceptScore W4310831689C41008148 @default.
• W4310831689 hasConceptScore W4310831689C53811970 @default.
• W4310831689 hasConceptScore W4310831689C80899671 @default.
• W4310831689 hasLocation W43108316891 @default.
• W4310831689 hasLocation W43108316892 @default.
• W4310831689 hasOpenAccess W4310831689 @default.
• W4310831689 hasPrimaryLocation W43108316891 @default.
• W4310831689 hasRelatedWork W1502186998 @default.
• W4310831689 hasRelatedWork W1541876729 @default.
• W4310831689 hasRelatedWork W1558145674 @default.
• W4310831689 hasRelatedWork W1566660502 @default.
• W4310831689 hasRelatedWork W2025716666 @default.
• W4310831689 hasRelatedWork W2043560626 @default.
• W4310831689 hasRelatedWork W2079263399 @default.
• W4310831689 hasRelatedWork W2079730540 @default.
• W4310831689 hasRelatedWork W2156896570 @default.
• W4310831689 hasRelatedWork W2544075308 @default.
• W4310831689 isParatext "false" @default.
• W4310831689 isRetracted "false" @default.
• W4310831689 workType "article" @default.