Traffic-light scheduling on the grid

DOI10.1016/0166-218X(94)90186-4zbMath0810.90036OpenAlexW2031060074WikidataQ127674318 ScholiaQ127674318MaRDI QIDQ1339892

David Peleg, Guy Kortsarz

Publication date: 11 December 1994

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90186-4

zbMATH Keywords

route schedulingtraffic-light type schedules

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ Periodic gossiping in back-to-back trees ⋮ Lower bounds on systolic gossip ⋮ Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees

This page was built for publication: Traffic-light scheduling on the grid