|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4952320||1364440||2017||9 صفحه PDF||سفارش دهید||دانلود کنید|
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.
Journal: Theoretical Computer Science - Volume 657, Part A, 2 January 2017, Pages 11-19