Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
We consider the problem of finding the minimal and maximal sets in a family F of sets, i.e. a collection of subsets of some domain. For a family of sets of size N we give an algorithm which finds these extremal sets in expected time O(N2/log N), and worst case time O(N2/√log N). All previous algorithms had worst case complexity of ω(N2). We also present a simple algorithm for dynamically recomputing the minimal and maximal sets as elements are inserted to and deleted from the subsets. This algorithm has a worst case bound of O(N) per update, and this bound is tight. © 1993.
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems