Algebraic structures for dynamic networks

DOI10.1016/j.jmp.2013.11.002zbMath1287.91125OpenAlexW2034357271MaRDI QIDQ2637088

Lucia Falzon, Nectarios Kontoleon, Philippa E. Pattison

Publication date: 19 February 2014

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2013.11.002

zbMATH Keywords

dynamic networksendomorphism algebrabetweenness in dynamic networksgeneralised Gauss-Seidel algorithmreachability in dynamic networkstime-ordered paths

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Relational systems, laws of composition (08A02)

Related Items (2)

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ Computing Betweenness Centrality in Link Streams

Cites Work

• Unnamed Item
• Unnamed Item
• A factorization procedure for finite algebras
• Graphs, dioids and semirings. New models and algorithms.
• A faster algorithm for betweenness centrality*
• Path Problems in Networks
• Semirings for social networks analysis
• An Algebra for Network Routing Problems
• A Note on Boolean Matrix Theory

This page was built for publication: Algebraic structures for dynamic networks