11 citations · 24 across the 4 of their papers we have counts for
5 papers
Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach
Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj +1
This work focuses on developing an effective meta-heuristic approach to protect against simultaneous attacks on nodes of a network modeled using a graph. Specifically, we focus on…
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, and respectively, on a few classes of planar graphs from the literatur…
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…
Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted -plexes
Milana Grbić, Aleksandar Kartelj, Savka Janković +2
In a network, a -plex represents a subset of vertices where the degree of each vertex in the subnetwork induced by this subset is at least . The maximum edge-weight …
Variable Neighborhood Search for solving Bandwidth Coloring Problem
Dragan Matic, Jozef Kratica, Vladimir Filipovic
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are general…