The solution algorithms for problems on the minimal vertex cover in networks and the minimal cover in Boolean matrixes

被引：0
|
作者：
Listrovoy, Sergey [1 ]
Minukhin, Sergii [2 ]
机构：
[1] Ukrainian State Academy of Railway Transport, 61050, Kharkov, Ukraine
[2] Kharkiv National University of Economics, 61166, Kharkov, Ukraine
来源：
International Journal of Computer Science Issues | 2012年 / 9卷 / 5 5-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：8 / 15
相关论文
共 50 条
  • [31] Minimal observability of Boolean networks
    Yang LIU
    Jie ZHONG
    Daniel W.C.HO
    Weihua GUI
    Science China(Information Sciences), 2022, 65 (05) : 157 - 168
  • [32] On Colorful Vertex and Edge Cover Problems
    Sayan Bandyapadhyay
    Aritra Banik
    Sujoy Bhore
    Algorithmica, 2023, 85 : 3816 - 3827
  • [33] On Colorful Vertex and Edge Cover Problems
    Bandyapadhyay, Sayan
    Banik, Aritra
    Bhore, Sujoy
    ALGORITHMICA, 2023, 85 (12) : 3816 - 3827
  • [34] On the Approximability of the Vertex Cover and Related Problems
    Han, Qiaoming
    Punnen, Abraham P.
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 161 - +
  • [35] Potential Game Theoretic Learning for the Minimal Weighted Vertex Cover in Distributed Networking Systems
    Sun, Changhao
    Sun, Wei
    Wang, Xiaochu
    Zhou, Qingrui
    IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (05) : 1968 - 1978
  • [36] Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
    Delbot, Francois
    Laforest, Christian
    Rovedakis, Stephane
    PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS 2014, 2014, 8878 : 307 - 322
  • [37] A random degree with strong minimal cover
    Lewis, Andrew E. M.
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2007, 39 : 848 - 856
  • [38] Cutting-plane algorithms and solution whitening for the vertex-cover problem
    Claussen, G.
    Hartmann, A. K.
    PHYSICAL REVIEW E, 2022, 106 (03)
  • [39] ALGORITHM FOR DETERMINATION OF MINIMAL CARDINALITY COVER
    LAVALLEE, I
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1973, 7 (AUG): : 17 - 28
  • [40] Approximation algorithms for the partition vertex cover problem
    Bera, Suman K.
    Gupta, Shalmoli
    Kumar, Amit
    Roy, Sambuddha
    THEORETICAL COMPUTER SCIENCE, 2014, 555 : 2 - 8
12345