2 citations · 3 across the 8 of their papers we have counts for
4 papers · 1 filter
Connected Partitions via Connected Dominating Sets
Aikaterini Niklanovits, Kirill Simonov, Shaily Verma +1
The classical theorem due to Győri and Lovász states that any -connected graph admits a partition into connected subgraphs, where each subgraph has a prescribed size and…
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
Samuel Baguley, Tobias Friedrich, Aneta Neumann +3
Parameterized analysis provides powerful mechanisms for obtaining fine-grained insights into different types of algorithms. In this work, we combine this field with evolutionary al…
Analysis of a Gray-Box Operator for Vertex Cover
Samuel Baguley, Tobias Friedrich, Timo Kötzing +3
Combinatorial optimization problems are a prominent application area of evolutionary algorithms, where the (1+1) EA is one of the most investigated. We extend this algorithm by int…
Connected -partition of -connected graphs and -claw-free graphs
Ralf Borndörfer, Katrin Casel, Davis Issac +3
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 ne…