The shortage of freshwater resources is a serious problem in the process of urbanization in the world, and even become the main constraint factor in some areas. In order to solve the problem, it is imperative to develop an effective, flexible and low-cost water resources management plan. Water resources optimal allocation is one of the hot topics in the field of water resources at present, such as water resources optimal k-edge cover problem. The k-edge cover problem aims to find an edge cover set with k edges in a given undirected graph. The efficient solution of this problem can play an important role in planning and setting up urban water resources network sites. Based on DNA molecular computing, the paper use a new parallel algorithm to solve k-edge cover problem with O(n 2) time complexity, which greatly simplifies the computing complexity.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.