Abstract

The problem of finding the complete set of admissible configurations of a distribution network is considered. When solving this problem, the tools of graph theory are used to find the limit graphs. A new method for finding the complete set of limit graphs is proposed, and a number of properties of this method and its soundness are proved. The efficiencies of various methods are compared on a qualitative level, and it is shown that our method is distinguished by a considerably higher computational speed.

中文翻译：

---

搜索配电网配置的方法

摘要

考虑找到配电网络的完整的一组可接受配置的问题。在解决这个问题时，利用图论的工具来寻找极限图。提出了一种寻找完整极限图集的新方法，并证明了该方法的许多性质及其合理性。在定性水平上比较了各种方法的效率，结果表明我们的方法以显着更高的计算速度而著称。