On Computing the Subset Graph of a Collection of Sets

DOI10.1006/jagm.1999.1032zbMath0948.68216OpenAlexW2054755197MaRDI QIDQ4935305

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)

Related Items (8)

Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗ ⋮ Computing the union join and subset graph of acyclic hypergraphs in subquadratic time ⋮ On the size of the subset partial order ⋮ Positional Dominance: Concepts and Algorithms ⋮ Fast sequential and parallel algorithms for finding extremal sets ⋮ A simple sub-quadratic algorithm for computing the subset partial order ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ 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