Analysis of greedy algorithm for vertex covering of random graph by cubes

被引：0

作者：

Toman, Eduard ^{[1
]}

Stanek, Martin ^{[1
]}

机构：

[1] Comenius Univ, Fac Math Phys & Informat, Dept Comp Sci, Bratislava 84248, Slovakia

来源：

COMPUTING AND INFORMATICS | 2006年 / 25卷 / 05期

关键词：

random graphs; vertex covering; greedy algorithm;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We study randomly induced subgraphs G of a hypercube. Specifically, we investigate vertex covering of G by cubes. We instantiate a greedy algorithm for this problem from general hypergraph covering algorithm [9], and estimate the length of vertex covering of G. In order to obtain this result, a number of theoretical parameters of randomly induced subgraph G were estimated.

引用

页码：393 / 404

页数：12

共 50 条

[11] A greedy algorithm for finding a large 2-matching on a random cubic graph
Bal, Deepak
Bennett, Patrick
Bohman, Tom
Frieze, Alan
JOURNAL OF GRAPH THEORY, 2018, 88 (03) : 449 - 481
[12] ON THE GREEDY ALGORITHM WITH RANDOM COSTS
MCDIARMID, C
MATHEMATICAL PROGRAMMING, 1986, 36 (03) : 245 - 255
[13] COVERING VERTICES OF A GRAPH BY VERTEX-DISJOINT PATHS
NOORVASH, S
PACIFIC JOURNAL OF MATHEMATICS, 1975, 58 (01) : 159 - 168
[14] COVERING VERTEX SET OF A GRAPH WITH SUBGRAPHS OF SMALLER DEGREE
LAWRENCE, J
DISCRETE MATHEMATICS, 1978, 21 (01) : 61 - 68
[15] COVERING VERTICES OF A GRAPH BY VERTEX-DISJOINT PATHS
NOORVASH, S
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (01): : A46 - A46
[16] COVERING THE EDGES OF A RANDOM GRAPH BY CLIQUES
FRIEZE, A
REED, B
COMBINATORICA, 1995, 15 (04) : 489 - 497
[17] Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
Weigt, M
Hartmann, AK
PHYSICAL REVIEW LETTERS, 2001, 86 (08) : 1658 - 1661
[18] Optimization of configurable greedy algorithm for covering arrays generation
State Key Laboratory for Novel Software Technology , Nanjing 210093, China
不详
Nie, C.-H. (changhainie@nju.edu.cn), 1600, Chinese Academy of Sciences (24):
[19] Asymptotic packing and the random greedy algorithm
Rodl, V
Thoma, L
RANDOM STRUCTURES & ALGORITHMS, 1996, 8 (03) : 161 - 177
[20] Worst case analysis of a greedy multicast algorithm in k-ary n-cubes
Fujita, S
2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 511 - 518

← 1 2 3 4 5 →