Author:
Graf Alessandra,Haxell Penny
Abstract
AbstractWe give an efficient algorithm that, given a graph G and a partition V1,…,Vm of its vertex set, finds either an independent transversal (an independent set {v1,…,vm} in G such that ${v_i} \in {V_i}$ for each i), or a subset ${\cal B}$ of vertex classes such that the subgraph of G induced by $\bigcup\nolimits_{\cal B}$ has a small dominating set. A non-algorithmic proof of this result has been known for a number of years and has been used 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference60 articles.
1. Lopsidependency in the Moser-Tardos Framework
2. Transversals of Vertex Partitions in Graphs
3. [26] Erdős, P. and Lovász, L. (1975) Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets (Keszthely, Hungary 1973), Vol. 10 of Colloquia Mathematica Societatis János Bolyai, pp. 609–627.
4. [25] Czumaj, A. and Scheideler, C. (2000) Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In Eleventh Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 30–39.
5. Sets of elements that pairwise generate a linear group
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献