Impact of memory size on graph exploration capability (Q947116): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal sequences for complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecemeal graph exploration by a mobile robot. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Universal Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of a pebble: Exploring and mapping directed graphs / 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: Automata and Labyrinths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on universal traversal sequences based on chains of length five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with little memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences for expander graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for network algorithms / 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: Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaten in planaren Graphen / rank
 
Normal rank

Latest revision as of 16:48, 28 June 2024

scientific article
Language Label Description Also known as
English
Impact of memory size on graph exploration capability
scientific article

    Statements

    Impact of memory size on graph exploration capability (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2008
    0 references
    graph exploration
    0 references
    finite automaton
    0 references
    memory size
    0 references
    mobile agent
    0 references
    robot
    0 references

    Identifiers