Social network coordination and graph routing

DOI10.1002/NET.10057MaRDI QIDQ4797947zbMATH OpenOpenAlexFDO

Authors Shmuel Onn, Elisheva Sperber

Publication date 10 March 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10057

zbMATH Keywords

approximation algorithmmotion planningplanar graphroutingcoloring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Social networks; opinion dynamics (91D30) Machine vision and scene understanding (68T45)

Recommendations

• Graphbots: mobility in discrete spaces
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Routing number of digraphs and product graphs
• Determination of social laws for multi-agent mobilization
• The complexity of routing with collision avoidance

Cited in

(2)

• Category-based routing in social networks: membership dimension and the small-world phenomenon
• Routing number of digraphs and product graphs

This page was built for publication: Social network coordination and graph routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797947)