Graph complexity composes ·Non- trees common E.g. data-dependent re-partitioning Combine this with merge trees etc Distribute to equal-sized ranges Sample to estimate histogram Randomly partitioned inputsGraph complexity composes • Non-trees common • E.g. data-dependent re-partitioning – Combine this with merge trees etc. Distribute to equal-sized ranges Sample to estimate histogram Randomly partitioned inputs