𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimization problems in multiple subtree graphs

✍ Scribed by Danny Hermelin; Dror Rawitz

Book ID
108112871
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
231 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimization problems in multiple-interv
Optimization problems in multiple-interval graphs
✍ Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror πŸ“‚ Article πŸ“… 2010 πŸ› Association for Computing Machinery 🌐 English βš– 330 KB
Optimization problems in multiple-interv
Optimization problems in multiple-interval graphs
✍ Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror πŸ“‚ Article πŸ“… 2010 πŸ› Association for Computing Machinery 🌐 English βš– 330 KB

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