An overview of graph covering and partitioning
S Schwartz - Discrete Mathematics, 2022 - Elsevier
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 …
and unified literature review. The holistic overview of graph covering given in this article …
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
In parameterized complexity, it is well-known that a parameterized problem is fixed-
parameter tractable if and only if it has a kernel—an instance equivalent to the input …
parameter tractable if and only if it has a kernel—an instance equivalent to the input …
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
Parameterized analysis provides powerful mechanisms for obtaining fine-grained insights
into different types of algorithms. In this work, we combine this field with evolutionary …
into different types of algorithms. In this work, we combine this field with evolutionary …
Approximation and parameterized algorithms for balanced connected partition problems
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 …
subgraphs of similar (or fixed) orders is a classical problem that has been intensively …
Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and …
AA Mehrizi, R Ghanbari, S Sadeghi… - Applied Soft …, 2024 - Elsevier
In a discrete balanced graph partitioning problem (DBGPP), a simple undirected weighted
graph in that both vertices and edges are weighted is given. The task is dividing vertices into …
graph in that both vertices and edges are weighted is given. The task is dividing vertices into …
Connected -partition of -connected graphs and -claw-free graphs
A connected partition is a partition of the vertices of a graph into sets that induce connected
subgraphs. Such partitions naturally occur in many application areas such as road networks …
subgraphs. Such partitions naturally occur in many application areas such as road networks …
Kernelization algorithms for a generalization of the component order connectivity problem
M Shirahashi, N Kamiyama - … of the Operations Research Society of …, 2023 - jstage.jst.go.jp
In the component order connectivity problem, we are given a finite undirected graph G=(V,
E) and non-negative integers k, ℓ. The goal of this problem is to determine whether there …
E) and non-negative integers k, ℓ. The goal of this problem is to determine whether there …
Combining Crown Structures for Vulnerability Measures
Over the past decades, various metrics have emerged in graph theory to grasp the complex
nature of network vulnerability. In this paper, we study two specific measures:(weighted) …
nature of network vulnerability. In this paper, we study two specific measures:(weighted) …
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
A connected k-partition of a graph is a partition of its vertex set into k classes such that each
class induces a connected subgraph. Finding a connected k-partition in which the classes …
class induces a connected subgraph. Finding a connected k-partition in which the classes …
Finding Minimum Balanced Separators-an Exact Approach
W Surau, R Borndörfer, S Schwartz - International Conference on …, 2021 - Springer
Balanced separators are node sets that split the graph into size bounded components. They
find applications in different theoretical and practical problems. In this paper we discuss how …
find applications in different theoretical and practical problems. In this paper we discuss how …