V. Filipovic

activity

20152020

most citedEdge metric dimension of some generalized Petersen graphs

33 citations · 58 across the 5 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2018★ 11 cited

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$ …

cs.DS2015★ 9 cited

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…

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

Variable Neighborhood Search for solving Bandwidth Coloring Problem

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