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 条

[41] The analysis of a list-coloring algorithm on a random graph
Achlioptas, D
Molloy, M
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 204 - 212
[42] Expansion properties of a random regular graph after random vertex deletions
Greenhill, Catherine
Holt, Fred B.
Wormald, Nicholas
EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (05) : 1139 - 1150
[43] A NEW ALGORITHM TO COMPUTE VERTEX CUTSETS IN A GRAPH
SRIMANI, PK
DE, D
SINHA, BP
COMPUTERS & ELECTRICAL ENGINEERING, 1981, 8 (04) : 293 - 299
[44] Algorithm for solution of a problem on packing of the graph vertex
Vojtishin, Yu.V.
Sharkovskaya, E.A.
Kibernetika i Vychislitel'naya Tekhnika, 1992, (01): : 170 - 172
[45] A Graph Partitioning Algorithm for Edge or Vertex Balance
El Moussawi, Adnan
Seghouani, Nacera Bennacer
Bugiotti, Francesca
DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2020, PT I, 2020, 12391 : 23 - 37
[46] VERTEX DEGREE IN THE INTERVAL GRAPH OF A RANDOM BOOLEAN FUNCTION
Daubner, J.
Toman, E.
ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2010, 79 (02): : 151 - 164
[47] Algorithm for Circuit Covering the Euclidean Complete Graph
Nuriyeva, Fidan
INFORMATION TECHNOLOGIES AND THEIR APPLICATIONS, PT I, ITTA 2024, 2025, 2225 : 260 - 274
[48] MINIMUM VERTEX WEIGHTED DEFICIENCY OF (G,F)-FACTORS - A GREEDY ALGORITHM
ANSTEE, RP
DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 247 - 260
[49] Greedy Local Search and Vertex Cover in Sparse Random Graphs (Extended Abstract)
Witt, Carsten
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 410 - 419
[50] A density-based greedy algorithm for higher strength covering arrays
Bryce, Renee C.
Colbourn, Charles J.
SOFTWARE TESTING VERIFICATION & RELIABILITY, 2009, 19 (01): : 37 - 53

← 1 2 3 4 5 →