位置：成果数据库 > 期刊 > 期刊详情页
An FPT algorithm for the vertex cover P4 problem
  • ISSN号：0166-218X
  • 期刊名称：Discrete Applied Mathematics
  • 时间：2016.2.19
  • 页码：186-190
  • 相关项目：顶点覆盖k-路问题
作者： J.H. Tu|Z.M. Jin|
同期刊论文项目
顶点覆盖k-路问题
期刊论文 15
同项目期刊论文
On the Number of Paths, Independent Sets, and Matchings of Low Order in (5, 6)-Fullerene Graphs
Rainbow numbers for matchings in plane triangulations
On the number of 5-matchings in boron-nitrogen fullerene graphs
A 2-approximation algorithm for the vertex cover P4 problem in cubic graphs
An Iterative Rounding 2-approximation Algorithm for the k-partial Vertex Cover Problem
On the Number of Paths, Independent Sets, and Matchings of Low Order in (5,6)-Fullerene Graphs
奖励收集顶点覆盖问题的一个2-近似算法
A fixed-parameter algorithm for the vertex cover P3 problem
The vertex cover P3 problem in cubic graphs
The degree resistance distance of cacti
The unicyclic graphs with maximum degree resistance distance
The generalized 3-connectivity of star graphs and bubble-sort graphs
Inertia of complex unit gain graphs