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 条
12345