An efficient algorithm for finding maximum cycle packings in reducible flow graphs

被引：0
|
作者：
Chen, XJ [1 ]
Zang, W [1 ]
机构：
[1] Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
来源：
ALGORITHMS AND COMPUTATION | 2004年 / 3341卷
关键词：
feedback set; cycle packing; network flow; algorithm; complexity;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are used extensively for code optimization and global data flow analysis. In this paper we present an O(n(2)mlog(n(2)/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs.
引用
收藏
页码：306 / 317
页数：12
相关论文
共 50 条
12345