Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs

07/19/2022
by   Katrin Casel, et al.
0

In the 1970s, Győri and Lovász showed that for a k-connected n-vertex graph, a given set of terminal vertices t_1, …, t_k and natural numbers n_1, …, n_k satisfying ∑_i=1^k n_i = n, a connected vertex partition S_1, …, S_k satisfying t_i ∈ S_i and |S_i| = n_i exists. However, polynomial algorithms to actually compute such partitions are known so far only for k ≤ 4. This motivates us to take a new approach and constrain this problem to particular graph classes instead of restricting the values of k. More precisely, we consider k-connected chordal graphs and a broader class of graphs related to them. For the first, we give an algorithm with O(n^2) running time that solves the problem exactly, and for the second, an algorithm with O(n^4) running time that deviates on at most one vertex from the given required vertex partition sizes.

READ FULL TEXT

page 1

page 3

page 13

page 15

research
07/10/2021

Connected k-partition of k-connected graphs and c-claw-free graphs

A connected partition is a partition of the vertices of a graph into set...
research
01/18/2018

Degree-constrained 2-partitions of graphs

A (δ≥ k_1,δ≥ k_2)-partition of a graph G is a vertex-partition (V_1,V_2)...
research
08/23/2021

Approximation and parameterized algorithms to find balanced connected partitions of graphs

Partitioning a connected graph into k vertex-disjoint connected subgraph...
research
06/04/2018

A Structure-aware Approach for Efficient Graph Processing

With the advent of the big data, graph are processed in an iterative man...
research
11/09/2022

Description Graphs, Matrix-Power Stabilizations and Graph Isomorphism in Polynomial Time

It is confirmed in this work that the graph isomorphism can be tested in...
research
10/10/2018

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent

Every square matrix A=(a_uv)∈C^n× n can be represented as a digraph havi...
research
06/28/2019

Algorithms for weighted independent transversals and strong colouring

An independent transversal (IT) in a graph with a given vertex partition...

Please sign up or login with your details

Forgot password? Click here to reset