Skip to main content
. 2019 Oct 25;15(10):e1007384. doi: 10.1371/journal.pcbi.1007384

Fig 9. Computing B-relaxation distance.

Fig 9

Connected nodes are in blue and restrictive hyperedges are in red for each iteration k. In this example, all nodes in gray are B3-connected to S = {a, b} and node r has B-relaxation distance of three.