Clique Partitioning Algorithms Based on Improved Merging Rules

ZHANG Lu-Feng; HE Lian-Yue; LI Si-Kun

您当前的位置：

首页 >

文章列表页 >

Clique Partitioning Algorithms Based on Improved Merging Rules

更新时间：2025-07-16

- Clique Partitioning Algorithms Based on Improved Merging Rules
- Acta Electronica Sinica Vol. 29, Issue 8, Pages: 1104-1106(2001)
- 作者机构：
  
  国防科技大学计算机学院607室,湖南,长沙,410073
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN407
- Published：2001
- 稿件说明：
移动端阅览
ZHANG Lu-Feng, HE Lian-Yue, LI Si-Kun. Clique Partitioning Algorithms Based on Improved Merging Rules[J]. Acta Electronica Sinica, 2001, 29(8): 1104-1106.
DOI：

ZHANG Lu-Feng, HE Lian-Yue, LI Si-Kun. Clique Partitioning Algorithms Based on Improved Merging Rules[J]. Acta Electronica Sinica, 2001, 29(8): 1104-1106. DOI：

摘要

图论中的团划分算法

对于高级综合中的分配有重要意义

目前高级综合中广泛采用的是C.J.Tseng等提出的近似算法.文中通过分析完全点和二分点的情况

提出了两个合并准则

指导改进了目前的团划分算法.经模拟测试表明

新算法明显提高了划分质量.

Abstract

Clique Partitioning is an important algorithm in data path synthesis.The present partition algorithm given by C.J.Tseng is widely used in High Level Synthesis.By analyzing the instance of Complete-point and Bi-partition point

two merge rules are presented in this paper to improve the partition algorithm.The experiments show that the partition results are improved notably by using the revised algorithm.

关键词

Keywords

references

Views

2349

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

HAN Shu

LIU Ming-ye

Related Institution

ASIC Research Center,Beijing Institute of Technology

⁰