DeepAI AI Chat
Log In Sign Up

Finding Independent Transversals Efficiently

by   Alessandra Graf, et al.
University of Waterloo

We give an efficient algorithm that, given a graph G and a partition V_1,...,V_m of its vertex set, finds either an independent transversal (an independent set {v_1,...,v_m} in G such that v_i∈ V_i for each i), or a subset B of vertex classes such that the subgraph of G induced by B has a small dominating set. A non-algorithmic proof of this result has been known for a number of years and has been applied to solve many other problems. Thus we are able to give algorithmic versions of many of these applications, a few of which we describe explicitly here.


page 1

page 2

page 3

page 4


Algorithms for weighted independent transversals and strong colouring

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

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Let G=(V(G),E(G)) be a finite simple undirected graph with vertex set V(...

Balanced Independent and Dominating Sets on Colored Interval Graphs

We study two new versions of independent and dominating set problems on ...

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems

Given a graph G and two independent sets S, T of G, the independent set ...

The Complexity of Finding Fair Independent Sets in Cycles

Let G be a cycle graph and let V_1,…,V_m be a partition of its vertex se...

Twin-width III: Max Independent Set and Coloring

We recently introduced the graph invariant twin-width, and showed that f...

Robot Subset Selection for Swarm Lifetime Maximization in Computation Offloading with Correlated Data Sources

Consider robot swarm wireless networks where mobile robots offload their...