Optimization problems in multiple-interval graphs
Published in Symposium on Discrete Algorithms • Jan 7, 2007
NobleIDNI3P75W81R70S50
Authors:,,
Ayelet Butman
Danny Hermelin
Moshe Lewenstein
Abstract
Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. We initiate the study of optimization problems in multiple-interval graphs by considering three classical problems: MINIMUM VERTEX COVER, MINIMUM DOMINATING ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!