45 citations · 115 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016
A GRASP approach for solving the 2-connected m-dominating set problem
Raka Jovanovic, Islam Safak Bayram, Stefan Voss
In this paper, we present a constructive heuristic algorithm for the -connected -dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is…
cs.DM2016★ 1 cited
A heuristic approach for dividing graphs into bi-connected components with a size constraint
Raka Jovanovic, Tatsushi Nishi, Stefan Voss
In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions…