Time-stamped graphs and their associated influence digraphs

DOI10.1016/S0166-218X(02)00497-3zbMath1019.05037MaRDI QIDQ1811116

Eddie Cheng, Marc J. Lipman, Jerrold W. Grossman

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Erdős numberinfluence digraphtime-stamped graph

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks ⋮ Components in time-varying graphs

Cites Work

• A survey of gossiping and broadcasting in communication networks
• Famous trails to Paul Erdős. With a sidebar by Paul M. B. Vitanyi.

This page was built for publication: Time-stamped graphs and their associated influence digraphs