Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy

Authors:
Minghui Jiang;Yong Zhang
Affiliations:
Department of Computer Science, Utah State University, Logan, UT;Department of Computer Science, Kutztown University of PA, Kutztown, PA
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 11
Cited 3

Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Perfect code is W[1]-complete

Information Processing Letters
Scheduling Split Intervals

SIAM Journal on Computing
Data reduction and exact algorithms for clique cover

Journal of Experimental Algorithmics (JEA)
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
Optimization problems in multiple-interval graphs

ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the parameterized complexity of some optimization problems related to multiple-interval graphs

Theoretical Computer Science
Recognizing d-interval graphs and d-track interval graphs

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Parameterized Complexity

Parameterized Complexity

Parameterized complexity in multiple-interval graphs: domination

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
k-gap interval graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new results on the parameterized complexities of k- VERTEX CLIQUE PARTITION and k-SEPARATING VERTICES in multiple-interval graphs and their complements, and present a very simple alternative proof of the W[1]-hardness of k-IRREDUNDANT SET in general graphs.