Efficient Enumeration of <span class="nowrap"><svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-0.2723999pt" id="M1" height="12.533pt" version="1.1" viewBox="-0.0657574 -12.2606 9.69102 12.533" width="9.69102pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-101" d="M530 686C535 705 530 712 521 712C504 712 448 684 359 674L358 648H393C437 648 439 646 429 593L400 435C372 447 345 448 332 448C286 448 194 414 144 373C68 311 23 203 23 111C23 26 57 -12 91 -12C120 -12 147 3 188 29C227 54 290 102 341 170H343L322 71C308 6 320 -12 341 -12C373 -12 442 27 501 96L485 120C455 91 422 67 408 67C401 67 401 76 404 91C440 294 479 473 530 686ZM387 375L355 241C326 187 200 53 142 53C126 53 109 73 109 130C109 217 154 337 218 381C240 396 265 404 297 404S372 390 387 375Z"/></g></svg>-</span>Minimal Paths in Reliability Evaluation of Multistate Networks

<div>Ratio <svg height="9.49473pt" id="M350" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 7.30254 9.49473" width="7.30254pt" 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="M529 97L508 118C475 75 449 58 438 58C428 58 421 66 415 104C393 234 374 403 364 496C345 670 307 712 254 712C220 712 174 691 153 669L161 645C176 653 194 658 206 658C237 658 261 640 278 562C287 522 290 483 293 434C223 269 110 105 23 9L32 -12C59 -6 85 0 108 7C152 64 251 252 300 366C307 297 315 221 337 82C346 24 363 -12 393 -12C425 -12 475 13 529 97Z"></path></g></svg> when <svg height="9.25202pt" id="M351" style="vertical-align:-3.29111pt" version="1.1" viewbox="-0.0498162 -5.96091 10.1103 9.25202" width="10.1103pt" 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="M515 96L502 119C471 88 431 62 423 62C416 62 411 70 417 101C440 223 469 341 497 448H486L412 422L380 277C330 188 210 57 152 57C137 57 126 69 139 124L195 366C210 431 205 448 182 448C155 448 89 413 23 350L36 326C73 354 103 376 112 376C118 376 118 365 113 340L61 118C54 90 52 68 52 51C52 0 75 -12 98 -12S151 -3 181 17C242 58 305 119 362 193H364L345 104C323 3 339 -12 359 -12C390 -12 464 35 515 96Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.929,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g></svg> = 4.</div>

Complexity

fig3

Figure 3

Figure 3: Efficient Enumeration of <span class="nowrap"><svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-0.2723999pt" id="M1" height="12.533pt" version="1.1" viewBox="-0.0657574 -12.2606 9.69102 12.533" width="9.69102pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-101" d="M530 686C535 705 530 712 521 712C504 712 448 684 359 674L358 648H393C437 648 439 646 429 593L400 435C372 447 345 448 332 448C286 448 194 414 144 373C68 311 23 203 23 111C23 26 57 -12 91 -12C120 -12 147 3 188 29C227 54 290 102 341 170H343L322 71C308 6 320 -12 341 -12C373 -12 442 27 501 96L485 120C455 91 422 67 408 67C401 67 401 76 404 91C440 294 479 473 530 686ZM387 375L355 241C326 187 200 53 142 53C126 53 109 73 109 130C109 217 154 337 218 381C240 396 265 404 297 404S372 390 387 375Z"/></g></svg>-</span>Minimal Paths in Reliability Evaluation of Multistate Networks 

Complexity

Efficient Enumeration of -Minimal Paths in Reliability Evaluation of Multistate Networks

Figure 3