Search citation statements

Paper Sections

Select...

4

1

Citation Types

0

7

0

Year Published

2021

2022

Publication Types

Select...

5

1

Relationship

0

6

Authors

Journals

(7 citation statements)

0

7

0

“…The most common strategies of T As [7], [23] are based on three node centrality metrics from graph theory: node degree, node closeness and node betweenness. Consider the data plane topology modeled by a graph G = (N, E) with a given set N of switches and a given set E of connecting links.…”

confidence: 99%

“…The most common strategies of T As [7], [23] are based on three node centrality metrics from graph theory: node degree, node closeness and node betweenness. Consider the data plane topology modeled by a graph G = (N, E) with a given set N of switches and a given set E of connecting links.…”

confidence: 99%

“…Besides centrality-based T As, another attack strategy has also been considered more recently in the evaluation of telecommunication networks to attacks against multiple nodes [30], which is based on an optimization problem known as the critical node detection (CND) problem. CND was first introduced in [27], where it was shown to be N P-hard, and, since then, different variants of CND have been addressed in different contexts [31].…”

confidence: 99%