Social network coordination and graph routing

DOI10.1002/NET.10057zbMATH Open1023.91048OpenAlexW2007605278MaRDI QIDQ4797947FDOQ4797947

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

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

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)

Cites Work

• Title not available (Why is that?)

Cited In (2)

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

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)