13th International Conference on Membrane Computing - MTA Sztaki

Fast distributed DFS solutions for edge-disjoint paths in digraphs
Table 3. Experimental runtime comparison of Algorithms A, B, C, C ∗ and D on 30
random digraphs, with n = 100 cells, m = 300 arcs.
Test f Algorithm A Algorithm B Algorithm C Algorithm C ∗ Algorithm D
case steps steps gain% steps gain% steps gain% steps gain%
over A over A over A over A
1 1 135 97 28 97 28 97 28 97 28
2 0 13 13 0 13 0 13 0 13 0
3 2 1198 513 57 499 58 658 45 492 59
4 3 1372 616 55 541 61 590 57 540 61
5 3 671 359 46 351 48 351 48 351 48
6 1 383 193 50 193 50 193 50 193 50
7 4 1458 677 54 669 54 838 43 666 54
8 1 641 269 58 267 58 267 58 265 59
9 3 147 123 16 123 16 123 16 123 16
10 2 225 173 23 171 24 171 24 171 24
11 2 1020 435 57 445 56 610 40 436 57
12 4 333 213 36 207 38 209 37 207 38
13 1 274 156 43 149 46 156 43 149 46
14 1 160 108 33 108 33 108 33 108 33
15 1 821 340 59 357 57 509 38 335 59
16 2 960 451 53 470 51 616 36 440 54
17 1 822 334 59 329 60 328 60 328 60
18 4 1388 606 56 570 59 590 57 570 59
19 2 1302 553 58 508 61 726 44 508 61
20 2 194 146 25 146 25 146 25 146 25
21 2 566 294 48 290 49 290 49 290 49
22 2 1420 566 60 548 61 556 61 547 61
23 1 134 98 27 98 27 98 27 98 27
24 4 1093 525 52 509 53 511 53 509 53
25 1 27 27 0 27 0 27 0 27 0
26 3 1151 504 56 478 58 647 44 475 59
27 3 385 259 33 253 34 253 34 253 34
28 0 13 13 0 13 0 13 0 13 0
29 2 660 326 51 319 52 320 52 319 52
30 3 391 247 37 243 38 243 38 243 38
197