Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …

Abstract Typically, Graph Coloring Problem (GCP) is one of the key features for graph
stam** in graph theory. The general approach is to paint at least edges, vertices, or the …

As a usual model for a variety of practical applications, the maximum diversity problem
(MDP) is computational challenging. In this paper, we present an opposition-based memetic …

We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph
Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use …

The quadratic assignment problem (QAP) is one of the most studied combinatorial
optimization problems with various practical applications. In this paper, we present breakout …

Balanced graph partitioning is a well known NP-complete problem with a wide range of
applications. These applications include many large-scale distributed problems including …

The quadratic assignment problem (QAP) is one of the most studied NP-hard problems with
various practical applications. In this work, we propose a powerful population-based …

The maximum clique problem (MCP) is one of the most popular combinatorial optimization
problems with various practical applications. An important generalization of MCP is the …

Critical node problems (CNPs) involve finding a set of critical nodes from a graph whose
removal results in optimizing a predefined measure over the residual graph. As useful …

Population-based memetic algorithms have been successfully applied to solve many difficult
combinatorial problems. Often, a population of fixed size is used in such algorithms to record …