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 条
12345