CONSTRAINT BIPARTITE VERTEX COVER - Simpler exact algorithms and implementations

被引：0
|
作者：
Bai, Guoqiang [1 ]
Fernau, Henning [1 ]
机构：
[1] Univ Trier, FB Abt Informat 4, D-54286 Trier, Germany
来源：
FRONTIERS IN ALGORITHMICS | 2008年 / 5059卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
CONSTRAINT BIPARTITE VERTEX COVER is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.
引用
收藏
页码：67 / 78
页数：12
相关论文
共 50 条
  • [31] Exact Algorithms for the Vertex Separator Problem in Graphs
    Cavalcante, Victor F.
    de Souza, Cid C.
    NETWORKS, 2011, 57 (03) : 212 - 230
  • [32] Optimal Sublinear Algorithms for Matching and Vertex Cover
    Behnezhad, Soheil
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 873 - 884
  • [33] Efficient algorithms for the max vertex cover problem
    Della Croce, Federico
    Paschos, Vangelis Th
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (03) : 674 - 691
  • [34] Parameterized Approximation Algorithms for Weighted Vertex Cover
    Mandal, Soumen
    Misra, Pranabendu
    Rai, Ashutosh
    Saurabh, Saket
    LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 177 - 192
  • [35] Parameterized Algorithms for Minimum Sum Vertex Cover
    Aute, Shubhada
    Panolan, Fahad
    LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 193 - 207
  • [36] Vertex cover preprocessing for influence maximization algorithms
    Rostamnia, Mehran
    Kianian, Sahar
    2019 IEEE 5TH CONFERENCE ON KNOWLEDGE BASED ENGINEERING AND INNOVATION (KBEI 2019), 2019, : 338 - 342
  • [37] Intuitive algorithms and t-vertex cover
    Kneis, Joachim
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 598 - +
  • [38] ON THE DIMENSION OF THE MINIMAL VERTEX COVER SEMIGROUP RING OF AN UNMIXED BIPARTITE GRAPH
    Bertone, Cristina
    Micale, Vincenzo
    MATEMATICHE, 2008, 63 (02): : 157 - 163
  • [39] 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
  • [40] 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
12345