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 条
  • [21] Bounds for graph energy in terms of vertex covering and clique numbers
    Ganie, Hilal A.
    Samee, U.
    Pirzada, S.
    Alghamdi, Ahmad M.
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2019, 7 (02) : 315 - 328
  • [22] MATCHING AND COVERING THE VERTICES OF A RANDOM GRAPH BY COPIES OF A GIVEN GRAPH
    RUCINSKI, A
    DISCRETE MATHEMATICS, 1992, 105 (1-3) : 185 - 197
  • [23] On the Vertex-Connectivity of an Uncertain Random Graph
    Li, Hao
    Gao, Xin
    IEEE ACCESS, 2020, 8 : 85504 - 85514
  • [24] A Simple Greedy Algorithm for Dynamic Graph Orientation
    Berglin, Edvin
    Brodal, Gerth Stolting
    ALGORITHMICA, 2020, 82 (02) : 245 - 259
  • [25] A Simple Greedy Algorithm for Dynamic Graph Orientation
    Edvin Berglin
    Gerth Stølting Brodal
    Algorithmica, 2020, 82 : 245 - 259
  • [26] The Greedy Independent Set in a Random Graph with Given Degrees
    Brightwell, Graham
    Janson, Svante
    Luczak, Malwina
    RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (04) : 565 - 586
  • [27] Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
    Hung, Eunpyeong
    Kao, Mong-Jen
    ALGORITHMICA, 2022, 84 (01) : 1 - 12
  • [28] Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
    Eunpyeong Hung
    Mong-Jen Kao
    Algorithmica, 2022, 84 : 1 - 12
  • [29] Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
    Koufogiannakis, Christos
    Young, Neal E.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 634 - 652
  • [30] FCV1: a new fast greedy covering algorithm
    Chen, Bin
    Hong, Yong
    Journal of Computer Science and Technology, 1998, 13 (04) : 369 - 374
12345