to give an explicit relationship between elements. Definitions of "low overhead" vary, but generally means constant overhead; in big O notation, O(1) overhead. A less restrictive definition is a succinct data structure, which allows greater overhead.

Definition

An implicit data structure is one with constant space overhead (above the information-theoretic lower bound).

Historically,

1.Previous
3.Next