Fully dynamic algorithms for maintaining extremal sets in a family of setsFootnote^∗

^∗This work was partially supported by Australia Research Council under its Small Grants Scheme.

References

• Pritchard , P. 1991 . Opportunistic algorithms for eliminating supersets . Acta Informatica , 28 : 733 – 754 .
   Web of Science ®Google Scholar
• Pritchard P. On computing the subset graph of a collection of sets Tech. Rep. ECS-LFCS-94-309 Dept. of Computer Sci., Univ. of Edinburgh. 1994
   Google Scholar
• Shen , H. 1995 . proc. 1995 International Conference on High Performance Computing . Fast parallel algorithms for finding extremal sets . 1995 , New Delhi, India.
   Google Scholar
• Shen , H. 1995 . Proc. Tenth Intern. Symp. Computer and Information Sciences . Finding extremal sets of a normal family of sets in O(N 2/log2 N) time and O(N 2/log3 N) space . 1995 , Ozmer, Turkey.
   Google Scholar
• Shen , H. 1995 . Proc. 8th Intern. Conf. of Parallel and Distributed Computing Systems . Optimal parallel algorithms for fully dynamic maintanence of extremal sets . 1995 , ICSA.
   Google Scholar
• Yellin , D. M. 1992 . Proc. 3rd ACM-SIAM Symp. Discrete Algorithms . Algorithms for subset testing and finding maximal sets . 1992 . pp. 386 – 392 . ACM/SIAM .
   Google Scholar
• Yellin , D. M. 1992 . Representing sets with constant time equality testing . J. Algorithms , 13 353 – 373 .
   Web of Science ®Google Scholar
• Yellin , D. M. 1994 . An algorithm for dynamic subset and intersection testing . Theoret. Comput. Set , 129 397 – 406 .
   Web of Science ®Google Scholar
• Yellin , D. M. and Jutla , C. S. 1993 . Finding extremal sets in less than quadratic time . Inform. Process. Lett. , 48 29 – 34 .
   Web of Science ®Google Scholar