Networked control systems under cyber attacks with applications to power networks
Networked control systems under certain cyber attacks are analyzed. The communication
network of these control systems make them vulnerable to attacks from malicious outsiders …
network of these control systems make them vulnerable to attacks from malicious outsiders …
A measure & conquer approach for the analysis of exact algorithms
For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have
been among the most common tools used for finding exact solutions of NP-hard problems …
been among the most common tools used for finding exact solutions of NP-hard problems …
Distributed fault detection and isolation resilient to network model uncertainties
The ability to maintain state awareness in the face of unexpected and unmodeled errors and
threats is a defining feature of a resilient control system. Therefore, in this paper, we study …
threats is a defining feature of a resilient control system. Therefore, in this paper, we study …
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O
(1.7159 n). This result can be seen as an algorithmic proof of the fact that the number of …
(1.7159 n). This result can be seen as an algorithmic proof of the fact that the number of …
[HTML][HTML] Exact algorithms for dominating set
The measure and conquer approach has proven to be a powerful tool to analyse exact
algorithms for combinatorial problems like Dominating Set and Independent Set. This …
algorithms for combinatorial problems like Dominating Set and Independent Set. This …
Measure and conquer: Domination–a case study
Davis-Putnam-style exponential-time backtracking algorithms are the most common
algorithms used for finding exact solutions of NP-hard problems. The analysis of such …
algorithms used for finding exact solutions of NP-hard problems. The analysis of such …
Cost-effective data placement in edge storage systems with erasure code
Edge computing, as a new computing paradigm, brings cloud computing's computing and
storage capacities to network edge for providing low latency services for users. The …
storage capacities to network edge for providing low latency services for users. The …
Minimum dominating set of multiplex networks: Definition, application, and identification
D Zhao, G **ao, Z Wang, L Wang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
The minimum dominating set (MDS) of the network is a node subset of smallest size that
every node in the network is either in this subset or is adjacent to one or more nodes of this …
every node in the network is either in this subset or is adjacent to one or more nodes of this …
A trade-off algorithm for solving p-center problems with a graph convolutional network
The spatial optimization method between combinatorial optimization problems and GIS has
many geographical applications. The p-center problem is a classic NP-hard location …
many geographical applications. The p-center problem is a classic NP-hard location …
On two techniques of combining branching and treewidth
Branch & Reduce and dynamic programming on graphs of bounded treewidth are among
the most common and powerful techniques used in the design of moderately exponential …
the most common and powerful techniques used in the design of moderately exponential …