Abstract

The minimum common supertree problem is to find a minimum k-ary common supertree for a given set T of labeled complete k-ary trees. This problem is an NP-hard problem. This paper presents a polynom...

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