Lower bounds on the length of universal traversal sequences (Q1201151): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Universal sequences for complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Universal Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Applications of Inductive Counting for Complementation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences for paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Lower Bounds for Maze Threadability on Restricted Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on probabilistic linear decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs / rank
 
Normal rank

Revision as of 13:01, 17 May 2024

scientific article
Language Label Description Also known as
English
Lower bounds on the length of universal traversal sequences
scientific article

    Statements

    Lower bounds on the length of universal traversal sequences (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    complexity of graph traversal
    0 references