Browsing by Author "Uğurlu, Onur"
Now showing items 15 of 5

A Distributed depth first Search based algorithm for edge connectivity estimation
Uğurlu, Onur; Akram, Vahid Khalilpour; Eliiyi, Deniz Türsel (IEEE, 2020)The edge connectivity of a network is the minimum number of edges whose removal disconnect the network. The edge connectivity determines the minimum number of edgedisjoint paths between all nodes. Hence finding the edge ... 
Independent strong weak domination: A mathematical programming approach
Berberler, Murat Ersen; Uğurlu, Onur; Berberler, Zeynep Nihan (World Scientific Publ Co Pte Ltd, 2020)Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in V  S is adjacent to at least one vertex of S. The domination number is the minimum cardinality of a dominating set. Let ... 
A localized distributed algorithm for vertex cover problem
Akram, Vahid Khalilpour; Uğurlu, Onur (Elsevier B.V., 2022)Finding the minimum vertex cover of a given graph is a wellknown NPHard problem that has many applications in various fields. In this paper, we propose a distributed localized algorithm for detecting vertex cover using ... 
Parallel identification of central nodes in wireless multihop networks
Eliiyi, Deniz Türsel; Arslan, Hilal; Akram, Vahid Khalilpour; Uğurlu, Onur (IEEE, 2020)A wireless multihop network is a collection of nodes that communicate by message passing over multiple links. Sending a message to a remote node can consume some energy from all intermediary nodes. In a network, the nodes ... 
A progressive search algorithm for the minimum hitting set problem
Given a finite universe and a collection of the subsets of the universe, the minimum hitting set of thecollection is the smallest subset of the universe that has nonempty intersection with each set in thecollection. Finding ...