The Complexity of Unions of Disjoint Sets
From MaRDI portal
Publication:3590939
DOI10.1007/978-3-540-70918-3_22zbMATH Open1186.68204OpenAlexW1891636518MaRDI QIDQ3590939FDOQ3590939
Authors: Christian Glaßer, Alan L. Selman, Stephen Travers, K. W. Wagner 
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_22
Recommendations
Cited In (15)
- Title not available (Why is that?)
- On the complexity of data disjunctions.
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
- Union-freeness, deterministic union-freeness and union-complexity
- Epsilon nets and union complexity
- Tuples of disjoint \(\mathsf{NP}\)-sets
- Complexity of Recognizing Equal Unions in Families of Sets
- The complexity of dissociation set problems in graphs
- A linear-time algorithm for a special case of disjoint set union
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic Analysis of Disjoint Set Union Algorithms
- The complexity of unions of disjoint sets
- Unions of disjoint NP-complete sets
- Unions of disjoint NP-complete sets
This page was built for publication: The Complexity of Unions of Disjoint Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590939)
