Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy.

COCOON'11: Proceedings of the 17th annual international conference on Computing and combinatorics（2011）

引用 5|浏览3

暂无评分

摘要

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.

查看译文

关键词

VERTEX CLIQUE PARTITION,general graph,k-IRREDUNDANT SET,k-SEPARATING VERTICES,multiple-interval graph,new result,parameterized complexity,simple alternative proof,Parameterized complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要