Improvement on Vertex Cover for low-degree graphs

doi:10.1002/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K

Details of Research Outputs

Status	已发表Published
Title	Improvement on Vertex Cover for low-degree graphs
Creator	Chen, Jianâer 1,2; Liu, Lihua 3; Jia, Weijia3
Date Issued	2000
Source Publication	Networks
ISSN	0028-3045
Volume	35 Issue:4 Pages:253-259
Abstract	We present an improved algorithm for the Vertex Cover problem on graphs of degree bounded by 3 (3DVC). We show that the 3DVC problem can be solved in time O(1.2192kk), where k is the number of vertices in a minimum vertex cover of the graph. Our algorithm also improves previous algorithms on the Independent Set problem on graphs with degree bounded by 3. © 2000 John Wiley & Sons, Inc.
Keyword	Algorithm Independent set Parame Terized computation Vertex cover
DOI	10.1002/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K
URL	View source
Indexed By	SCIE ; CPCI-S
Language	英语English
WOS Research Area	Computer Science ; Operations Research & Management Science
WOS Subject	Computer Science, Hardware & Architecture ; Operations Research & Management Science
WOS ID	WOS:000087752700003
Citation statistics	Cited Times:26[WOS] [WOS Record] [Related Records in WOS]
Document Type	Journal article
Identifier	http://repository.uic.edu.cn/handle/39GCC9TT/2020
Collection	Research outside affiliated institution
Corresponding Author	Chen, Jianâer
Affiliation	1.College of Information Engineering, Central-South Univ. of Technology, ChangSha, Hunan, China 2.Department of Computer Science, Texas A and M University, College Station, TX 77843-3112, United States 3.Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong
Recommended Citation GB/T 7714	Chen, Jianâer,Liu, Lihua,Jia, Weijia. Improvement on Vertex Cover for low-degree graphs[J]. Networks, 2000, 35(4): 253-259.
APA	Chen, Jianâer, Liu, Lihua, & Jia, Weijia. (2000). Improvement on Vertex Cover for low-degree graphs. Networks, 35(4), 253-259.
MLA	Chen, Jianâer,et al."Improvement on Vertex Cover for low-degree graphs". Networks 35.4(2000): 253-259.

Files in This Item:
There are no files associated with this item.

Related Services

Usage statistics

Google Scholar

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh