Fast periodic graph exploration with constant memory (Q931724): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2007.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981557449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Environments / 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: The power of a pebble: Exploring and mapping directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and Labyrinths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: 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: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Periodic Graph Exploration with Constant Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting Port Numbers for Fast Graph Exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaten in planaren Graphen / rank
 
Normal rank

Latest revision as of 11:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Fast periodic graph exploration with constant memory
scientific article

    Statements

    Fast periodic graph exploration with constant memory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    finite automaton
    0 references
    period
    0 references
    port number
    0 references
    penalty
    0 references
    full degree
    0 references

    Identifiers