Polynomial universal traversing sequences for cycles are constructible

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 491-503

  Istrail, Sorin ^a  

^a WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

EXPLICIT CONSTRUCTIONS; PROBABILISTIC ARGUMENTS; UPPER BOUND;

GRAPH THEORY;

EID: 0013174683     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62260     Document Type: Conference Paper

References (0)