Planar graph vertex partition for linear problem kernels

被引：16

作者：

Wang, Jianxin ^{[1
]}

Yang, Yongjie ^{[1
]}

Guo, Jiong ^{[2
]}

Chen, Jianer ^{[1
,3
]}

机构：

[1] Cent S Univ, Sch Informat Sci & Engn, Changsha 410083, Hunan, Peoples R China

[2] Univ Saarland, D-66123 Saarbrucken, Germany

[3] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2013年 / 79卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Parameterized algorithm; Kernelization; Connected vertex cover; Edge dominating set; Maximum triangle packing; CONNECTED DOMINATING SET; KERNELIZATION;

D O I：

10.1016/j.jcss.2012.08.001

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A simple partition of the vertex set of a graph is introduced to analyze kernels for planar graph problems in which vertices and edges not in a solution have small distance to the solution. This method directly leads to improved kernel sizes for several problems, without needing new reduction rules. Moreover, new kernelization algorithms are developed for CONNECTED VERTEX COVER, EDGE DOMINATING SET, and MAXIMUM TRIANGLE PACKING problems, further improving the kernel sizes for these problems. (C) 2012 Elsevier Inc. All rights reserved.

引用

页码：609 / 621

页数：13

共 50 条

[1] Linear Problem Kernels for Planar Graph Problems with Small Distance Property
Wang, Jianxin
Yang, Yongjie
Guo, Jiong
Chen, Jianer
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 592 - 603
[2] ON THE LINEAR VERTEX-ARBORICITY OF A PLANAR GRAPH
POH, KS
JOURNAL OF GRAPH THEORY, 1990, 14 (01) : 73 - 75
[3] On the feedback vertex set problem for a planar graph
Praktische Mathematik, Chrstn.-Albrechts-Univ. zu Kiel, D-24098 Kiel, Germany
Comput Vienna New York, 2 (129-155):
[4] On the feedback vertex set problem for a planar graph
Hackbusch, W
COMPUTING, 1997, 58 (02) : 129 - 155
[5] A GRAPH APPROXIMATION HEURISTIC FOR THE VERTEX COVER PROBLEM ON PLANAR GRAPHS
MEEK, DL
PARKER, RG
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (03) : 588 - 597
[6] Inserting a Vertex into a Planar Graph
Chimani, Markus
Gutwenger, Carsten
Mutzel, Petra
Wolf, Christian
PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 375 - 383
[7] A GRAPH PARTITION PROBLEM
刘彦佩
Acta Mathematicae Applicatae Sinica, 1996, (04) : 393 - 400
[8] A Graph Partition Problem
Cioaba, Sebastian M.
Cameron, Peter J.
AMERICAN MATHEMATICAL MONTHLY, 2015, 122 (10): : 972 - 982
[9] Linear problem kernels for NP-hard problems on planar graphs
Guo, Jiong
Niedermeier, Rolf
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 375 - +
[10] A note on the computational complexity of graph vertex partition
Huang, Yuanqiu
Chub, Yuming
DISCRETE APPLIED MATHEMATICS, 2007, 155 (03) : 405 - 409

← 1 2 3 4 5 →