New bounds on the size of the minimum feedback vertex set in meshes and butterflies

被引:39
|
作者
Caragiannis, I [1 ]
Kaklamanis, C
Kanellopoulos, P
机构
[1] Univ Patras, Comp Technol Inst, Patras 26500, Greece
[2] Univ Patras, Dept Comp Engn & Informat, Patras 26500, Greece
关键词
feedback vertex set; interconnection networks; algorithms;
D O I
10.1016/S0020-0190(02)00266-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The bounds on the size of the minimum feedback vertex set in meshes and butterflies were presented in the context of interconnection networks. Alternative ways were examined for computing small feedback vertex sets in two-dimensional meshes including a method which extends to meshes of higher dimensions. The bounds obtained for meshes were proved to be asymptotically optimal by giving almost matching lower bounds.
引用
收藏
页码:275 / 280
页数:6
相关论文
共 50 条