Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952320 | Theoretical Computer Science | 2017 | 9 Pages |
Abstract
Network reconfiguration is an important research topic in the planning and operation of power distribution networks. In this paper, we study the partition problem on trees with supply and demand from parameterized computation perspective. We analyze the relationship between supply nodes and demand nodes, and give four reduction rules, which result in a kernel of size O(k2) for the problem. Based on branching technique, a parameterized algorithm of running time Oâ(2.828k) is presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mugang Lin, Qilong Feng, Jianer Chen, Wenjun Li,