Dragan Matic

activity

20182021

most citedAn Integer Linear Programming Formulation for the Convex Dominating Set Problems

4 citations · 4 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2021

The Signed (Total) Roman Domination Problem on some Classes of Planar Graphs -- Convex Polytopes

Tatjana Zec, Marko Djukanovic, Dragan Matic

In this paper we deal with the calculation of the signed (total) Roman domination numbers, $γ_{s R}$ and $γ_{s tR}$ respectively, on a few classes of planar graphs from the literatur…

math.OC2019★ 4 cited

An Integer Linear Programming Formulation for the Convex Dominating Set Problems

Jozef Kratica, Vladimir Filipovic, Dragan Matic +1

Due to their importance in practice, dominating set problems in graphs have been greatly studied in past and different formulations of these problems are presented in literature. T…

cs.DS2018

Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted $k$ -plexes

Milana Grbić, Aleksandar Kartelj, Savka Janković +2

In a network, a $k$ -plex represents a subset of $n$ vertices where the degree of each vertex in the subnetwork induced by this subset is at least $n - k$ . The maximum edge-weight $k$ …

The Signed (Total) Roman Domination Problem on some Classes of Planar Graphs -- Convex Polytopes

An Integer Linear Programming Formulation for the Convex Dominating Set Problems

Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k-plexes

Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted $k$ -plexes