On the parameterized complexity of multiple-interval graph problems

Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval associated with it. Many applications of interval graphs also generalize to multiple-interval graphs, often allowing for more robustness in the modeling of the specific applicat...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 410; no. 1; pp. 53 - 61
Main Authors:	Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.01.2009 Elsevier
Subjects:	Applied sciences Calculus of variations and optimal control Clique Computer Science Computer science; control theory; systems Data Structures and Algorithms Dominating set Exact sciences and technology Independent set Information retrieval. Graph Mathematical analysis Mathematics Miscellaneous Multicolored clique Multiple intervals Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Parameterized complexity Sciences and techniques of general use Theoretical computing W-hardness Multiple intervals Dominating set W-hardness Multicolored clique Independent set Clique Parameterized complexity Interval graph Vertex Computer theory Optimization method Unit Modeling Optimization Complexity Robustness Application
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!