While graph covering is a fundamental and well-studied problem, this field lacks a broad
and unified literature review. The holistic overview of graph covering given in this article …

Coverage path planning (CPP) of multiple Dubins robots has been extensively applied in
aerial monitoring, marine exploration, and search and rescue. Existing multi-robot coverage …

This work addresses the balanced connected k-partition problem (BCP k), which is formally
defined as follows. Given a connected graph G=(V, E) with nonnegative weights on the …

Task allocation for a multi-robot system is often imposed with various constraints to promote
efficiency and avoid unwanted consequences. This study focuses on the min-max balanced …

Complete coverage, which is integral to many robotic applications, aims to cover an area as
quickly as possible. In such tasks, employing multiple robots can reduce the overall …

For a fixed integer k ≥ 2, the balanced connected k-partition problem (BCP _k) consists in
partitioning a graph into k mutually vertex-disjoint connected subgraphs of similar weight …

For a given integer k≥ 2, partitioning a connected graph into k vertex-disjoint connected
subgraphs of similar (or fixed) orders is a classical problem that has been intensively …

This article deals with the problem of partitioning a graph into pp connected components by
optimizing some balancing objective functions related to the vertex weights. Objective …

Abstract The Maximum Bisection Problem (MBP) is a well-known combinatorial optimization
problem that has been proven to be NP-hard. The maximum bisection of a graph is the …

Partitioning biological network into smaller components can help in retrieving new
information of a particular biological structure. In this research we investigate the problem of …