Universal traversal sequences for expander graphs

Shlomo Hoory, Avi Wigderson*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

22 Scopus citations
Original languageEnglish
Pages (from-to)67-69
Number of pages3
JournalInformation Processing Letters
Volume46
Issue number2
DOIs
StatePublished - 17 May 1993

Keywords

  • computational complexity
  • connectivity
  • expander graphs
  • explicit construction
  • space-bounded computation
  • Universal traversal sequence

Cite this