Abstract
A heuristic algorithm using tree decompositions for the maximum happy vertices problem
Full Text
Sign-in/Register to access full text options
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