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 条
  • [21] Evolutionary algorithms and the vertex cover problem
    Oliveto, P. S.
    He, J.
    Yao, X.
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 1870 - 1877
  • [22] Vertex Cover of Networks and Its Related Optimization Problems: An Overview
    Chen, Jie
    Zhou, Rongpei
    Wu, Jie
    Zhang, Hui
    Gui, Weihua
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024,
  • [23] Experimental analysis of approximation algorithms for the vertex cover and set covering problems
    Gomes, Fernando C.
    Meneses, Claudio N.
    Pardalos, Panos M.
    Viana, Gerardo Valdisio R.
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3520 - 3534
  • [24] Distributed and Parallel Algorithms for Weighted Vertex Cover and other Covering Problems
    Koufogiannakis, Christos
    Young, Neal E.
    PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 171 - 179
  • [25] Minimal Cover of Implication Rules to Represent Two Mode Networks
    Neto, Sebastiao M.
    Zarate, Luis E.
    Song, Mark A. J.
    Dias, Sergio M.
    2015 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT), VOL 1, 2015, : 211 - 218
  • [26] Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
    Daniel Mölle
    Stefan Richter
    Peter Rossmanith
    Theory of Computing Systems, 2008, 43 : 234 - 253
  • [27] Enumerate and expand:: Improved algorithms for connected vertex cover and tree cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 270 - 280
  • [28] Enumerate and expand:: Improved algorithms for connected Vertex Cover and Tree Cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    THEORY OF COMPUTING SYSTEMS, 2008, 43 (02) : 234 - 253
  • [29] Minimal observability of Boolean networks
    Liu, Yang
    Zhong, Jie
    Ho, Daniel W. C.
    Gui, Weihua
    SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (05)
  • [30] Minimal observability of Boolean networks
    Yang Liu
    Jie Zhong
    Daniel W. C. Ho
    Weihua Gui
    Science China Information Sciences, 2022, 65
12345