Novel Node Centrality-Based Efficient Empirical Robustness Assessment for Directed Network

<div><svg height="11.7978pt" id="M217" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -11.5914 14.1371 11.7978" width="14.1371pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M238 681C243 705 239 712 230 712C217 712 156 682 75 674L70 648H105C148 648 153 641 144 598L39 110C18 11 35 -12 55 -12C90 -12 166 36 221 103L205 125C174 93 130 65 118 65C112 65 108 68 114 96L238 681Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,3.498,-5.741)"><path d="M556 236V289H56V236H556Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,9.058,-5.741)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g></svg> comparison result of iteration times.</div>

Complexity

fig21

Figure 21

Figure 21: Novel Node Centrality-Based Efficient Empirical Robustness Assessment for Directed Network 