An Algorithm for the Generation of All the Essential Complementary Partitions

您当前的位置：

首页 >

文章列表页 >

更新时间：2025-12-08

- An Algorithm for the Generation of All the Essential Complementary Partitions
- Acta Electronica Sinica Issue 2, Pages: 122-125(1987)
- 作者机构：
  
  东北电力学院
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1987
- 稿件说明：
移动端阅览
[1]关信,马昭彦,全一男.关于基本补划分的生成[J].电子学报,1987(02):122-125.

Guan Xin, Ma Zhao-yan and Quan Yi-nan. An Algorithm for the Generation of All the Essential Complementary Partitions[J]. Acta Electronica Sinica, 1987, (2): 122-125.
[1]关信,马昭彦,全一男.关于基本补划分的生成[J].电子学报,1987(02):122-125. DOI：

Guan Xin, Ma Zhao-yan and Quan Yi-nan. An Algorithm for the Generation of All the Essential Complementary Partitions[J]. Acta Electronica Sinica, 1987, (2): 122-125. DOI：

本文给出了生成基本补划分的算法

按此算法

对于任意给定的划分

可依次生成其所有的基本补划分。同时本文提出通过变换使这一问题得以简化的方法

从而减少了计算量

这对实际计算有重要意义。本文从“无环联络”概念出发

对任意划分的基本补划分进行直接构造

是有别于他文之处。

An algorithm for the generation of all the essential complementary partitions （ECP） of a .given partition is described

and the transformation of a given partition into "natural arranged partition* proposed in this paper makes the algorithm simplified

thus reducing the amount of calculation

which is of great significance in the actual application of the algorithm.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰