On Computing the Subset Graph of a Collection of Sets

DOI10.1006/JAGM.1999.1032MaRDI QIDQ4935305zbMATH OpenOpenAlexFDO

Authors Paul A. Pritchard

Publication date 19 March 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c11292dc60f38bfe841b8cff00a32fb6d3117dd4

zbMATH Keywords

partial ordersubset graphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• The subset partial order: computing and combinatorics
• Computing the subset partial order for dense families of sets
• A simple sub-quadratic algorithm for computing the subset partial order
• A fast bit-parallel algorithm for computing the subset partial order
• On the size of the subset partial order

Cited in

(12)

• A fast bit-parallel algorithm for computing the subset partial order
• Fast sequential and parallel algorithms for finding extremal sets
• Positional dominance: concepts and algorithms
• scientific article; zbMATH DE number 1215120 (Why is no real title available?)
• Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗
• On the size of the subset partial order
• On the complexity of strongly connected components in directed hypergraphs
• The subset partial order: computing and combinatorics
• Computing subset transversals in H-free graphs
• A simple sub-quadratic algorithm for computing the subset partial order
• Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
• Computing the subset partial order for dense families of sets

This page was built for publication: On Computing the Subset Graph of a Collection of Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935305)