Finding independent transversals efficiently (Q4987260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Random Walks That Find Perfect Objects and the Lovász Local Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ryser's conjecture for tripartite 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection of a matroid and a simplicial complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent systems of representatives in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated spheres and colored cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hall's theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Colouring with Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding perfect matchings in bipartite hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa Claus Meets Hypergraph Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa claus meets hypergraph matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to the Lovász local lemma. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improvement of the Lovász Local Lemma via Cluster Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complete subgraphs of \(r\)-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of elements that pairwise generate a linear group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for the Lovász Local Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Hitting Maximum and Maximal Cliques With a Stable Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals of Vertex Partitions in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Weighted Independent Transversals and Strong Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsidependency in the Moser-Tardos Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Moser--Tardos Framework with Partial Resampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive algorithm for the Lovász Local Lemma on permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition for matchability in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a conjecture of Ryser / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex List Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Strong Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the strong chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Forming Committees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Independent Transversals are Odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size components -- partitions and transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Subgraphs of <i>r</i>-partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revival of the girth conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The circular chromatic index of graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting all maximum cliques with a stable set using lopsided independent transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moser and tardos meet Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sharper Local Lemma with Improved Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost perfect matchings in random uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique complex and hypergraph matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Moser--Tardos Algorithmic Local Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hitting all maximum cliques with an independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for transversals in graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent transversals in \(r\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy / rank
 
Normal rank

Latest revision as of 11:47, 4 December 2024

scientific article; zbMATH DE number 7341483
Language Label Description Also known as
English
Finding independent transversals efficiently
scientific article; zbMATH DE number 7341483

    Statements

    Finding independent transversals efficiently (English)
    0 references
    0 references
    0 references
    30 April 2021
    0 references
    independent transversal
    0 references
    efficient algorithm
    0 references
    maximum degree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references