A Tight Bound for EMAC - CWI
A Tight Bound for EMAC - CWI
A Tight Bound for EMAC - CWI
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Collisions. Suppose a structure graph G = GM π ∈G(M) is exposed edge by<br />
edge (i.e. in step i the value [i]G is shown to us). We say that G has a collision<br />
in step i if the edge exposed in step i points to a vertex which is already in the<br />
graph. With Col(G) we denote all collisions, i.e. all pairs (i, j) whereinstepi<br />
there was a collision which hit the vertex computed in step j
Change language