On Computing the Subset Graph of a Collection of Sets

@article{Pritchard1999OnCT,
  title={On Computing the Subset Graph of a Collection of Sets},
  author={Paul Pritchard},
  journal={J. Algorithms},
  year={1999},
  volume={33},
  pages={187-203}
}
  • P. Pritchard
  • Published 1 November 1999
  • Computer Science, Mathematics
  • J. Algorithms
Abstract Let a given collection of sets have size N measured by the sum of the cardinalities. Yellin and Jutla presented an algorithm which constructed the partial order induced by the subset relation (a “subset graph”) in a claimed O ( N 2 /log  N ) operations over a dictionary ADT, and exhibited a collection whose subset graph had Θ( N 2 /log 2 N ) edges. This paper first establishes a matching upper bound on the number of edges in a subset graph. It also presents a finer analysis of the… 

A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order

TLDR
This paper gives implementations of a variant of a previously proposed algorithm which exploit bit-parallel operations on a RAM with Theta(log N) -bit words to have a worst-case complexity of O(N2 log log N / log2N) operations.

Computing the subset partial order for dense families of sets

  • Amr Elmasry
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 2009

The Subset Partial Order: Computing and Combinatorics

TLDR
It is shown that the size of the partial order graph induced by the subset relation (called the subset graph) is [EQUATION], where B = log (N/ log2 N), which implies a simpler proof to the O(N2/log2 N) bound concluded in [2].

On the size of the subset partial order

Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time

TLDR
It is shown that, if the Strong Exponential Time Hypothesis is true, both problems cannot be solved in O ( N ) time for α-acyclic hypergraphs and any constant ε > 0, even if the created graph is sparse.

Fully dynamic algorithms for maintaining extremal sets in a family of sets

  • Hong Shen
  • Computer Science, Mathematics
    Int. J. Comput. Math.
  • 1998
TLDR
These algorithms are the first linear-time fully dynamic algorithms for maintaining extremal sets, which, requiring extra words in space within the same bound O(N 2), improve the time complexity of the existing result by a factor of O( N).

Strongly connected components of directed hypergraphs

TLDR
A superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs is established, showing that it is combinatorially more complex than in directed graphs.

Fast Algorithms for Finding Extremal Sets

TLDR
Two new algorithms for the extremal set finding task are described and it is shown that both these algorithms provide excellent performance in practice, and can identify all extremal sets from multi-gigabyte itemset data using only a single processor core.

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems

Computing the Subset Partial Order: Progress and Open Problems Extended Abstract

TLDR
The published work on the problem of eeciently computing this partial order is reviewed, recent progress is described, and the outstanding questions are described.

References

SHOWING 1-10 OF 10 REFERENCES

Finding Extremal Sets in Less than Quadratic Time

An efficient representation for sparse sets

TLDR
A representation is described that supports constant-time implementations of clear-set, add-member, and delete-member and supports an efficient forall iterator, allowing enumeration of all the members of a set in time proportional to the cardinality of the set.

An Eecient Representation for Sparse Sets

TLDR
A representation is described that supports constant-time implementations of clear-set, add-member, and delete-member and supports an eecient forall iterator, allowing enumeration of all the members of a set in time proportional to the cardinality of the set.

A Generalization of Binary Search

  • R. Karp
  • Mathematics, Computer Science
    WADS
  • 1993
TLDR
The paper determines the best-case number of function evaluations needed to solve the (n, m) problem and gives one particular algorithm achieving the worst-case bound.

The Design and Analysis of Computer Algorithms

TLDR
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

Dynamic perfect hashing: upper and lower bounds

TLDR
An Omega (log n) lower bound is proved for the amortized worst-case time complexity of any deterministic algorithm in a class of algorithms encompassing realistic hashing-based schemes.

The Design and Analysis of Computer Algorithms

TLDR
This course presents fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their performance in graph algorithms.

An Old Sub-Quadratic Algorithm for Finding Extremal Sets

A generalization of binary search, in \Algorithms and Data Structures

  • Lect. Notes in Comp. Sci
  • 1993

An e  cient representation for sparse sets , ACMLett

  • Prog . Lang . Sys .
  • 1993