On Computing the Subset Graph of a Collection of Sets

Journal of Algorithms

Volumn 33, Issue 2, 1999, Pages 187-203

  Pritchard, Paul ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345828279     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1032     Document Type: Article

References (9)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. P. Briggs and L. Torczon, An efficient representation for sparse sets, ACM Lett. Prog. Lang. Sys. 2 (1993), 59-69.
3. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, Dynamic perfect hashing: upper and lower bounds, SIAM J. Comput. 23 (1994), 738-761.
4. R. L. Graham, D. E. Knuth and O. Patashnik, "Concrete Mathematics," Addison-Wesley, Reading, MA, 1989.
5. R. M. Karp, A generalization of binary search, in "Algorithms and Data Structures" (F. Dehne, J.-R. Sack, N. Santoro and S. Whitesides, Eds.), pp. 27-34, Lect. Notes in Comput. Sci., Vol. 709, Springer-Verlag, New York/Berlin, 1993.
6. P. Pritchard, Algorithms for finding matrix models of propositional calculi, J. Automated Reasoning 7 (1991), 475-487.
7. P. Pritchard, Opportunistic algorithms for eliminating supersets, Acta Inform. 28 (1991), 733-754.
8. P. Pritchard, An old sub-quadratic algorithm for finding extremal sets, Inform. Process. Lett. 62 (1997), 329-334.
9. D. M. Yellin and C. S. Jutla, Finding extremal sets in less than quadratic time, Inform. Process. Lett. 48 (1993), 29-34.