More efficient periodic traversal in anonymous undirected graphs
10.1007/978-3-642-11476-2_14
Saved in:
Main Authors: | Czyzowicz, J., Dobrev, S., Ga̧sieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lignos, I., Martin, R., Sadakane, K., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/41173 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
More efficient periodic traversal in anonymous undirected graphs
by: Czyzowicz, J., et al.
Published: (2013) -
Edge Selection for Undirected Graphs
by: Meng Hwee Victor Ong, et al.
Published: (2018) -
Finding short right-hand-on-the-wall walks in graphs
by: Dobrev, S., et al.
Published: (2013) -
EXTENDING DISTRIBUTED DYKSTRA'S ALOGORITHM FOR UNDIRECTED GRAPHS
by: KEVIN LAM KAIBIN
Published: (2021) -
EXTENDING DISTRIBUTED DYKSTRA'S ALOGORITHM FOR UNDIRECTED GRAPHS
by: KEVIN LAM KAIBIN
Published: (2021)