Skip to main navigation Skip to search Skip to main content

Universal traversal sequences for expander graphs

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

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

Cite this