Abstract
An O( n 3) algorithm for finding a minimum weighted maximal irredundant set of interval graphs with n vertices is presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
