Graph signatures: Identification and optimization

•New graph-theoretic paradigm called a “graph signature” is introduced.•Can generalize classical graph properties and invariants to graph sequences.•Dynamic programming approach for the generic problem is proposed.•Clique, core, and 2-club signatures are used to illustrate the framework.•Computational studies detect non-trivial persistent patterns in temporal networks.