On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups

類似資料

• A note on compact and compact circular edge-colorings of graphs
  著者:: Dariusz Dereniowski, 等
  出版事項: (2008-01-01)
• The Cerný conjecture for automata respecting intervals of a directed graph
  著者:: Mariusz Grech, 等
  出版事項: (2013-11-01)
• 1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
  著者:: Rafal Witkowski, 等
  出版事項: (2013-11-01)
• Two player game variant of the Erd\H os-Szekeres problem
  著者:: Parikshit Kolipaka, 等
  出版事項: (2013-11-01)
• The Magnus-Derek game in groups
  著者:: Dániel Gerbner
  出版事項: (2013-11-01)