Abstract

In this paper we introduce a new quick-find data structure to represent disjoint sets, called binomial list, showing that it has a better single-operation worst case time complexity than any previo...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call