Edge exploration of anonymous graph by mobile agent with external help (Q6488105): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
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: Lower bounds on the length of universal traversal sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label-guided graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with little memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Graph Exploration with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal constrained graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computing with advice: information sensitivity of graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication algorithms with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local MST computation with short advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-offs between the size of advice and broadcasting time in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology recognition with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Graph Exploration with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short labeling schemes for topology recognition in wireless tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the size and the diameter of a radio network using short labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast radio broadcasting with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online graph exploration: New results on old and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank

Revision as of 11:53, 3 December 2024

scientific article; zbMATH DE number 7667865
Language Label Description Also known as
English
Edge exploration of anonymous graph by mobile agent with external help
scientific article; zbMATH DE number 7667865

    Statements

    Edge exploration of anonymous graph by mobile agent with external help (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2023
    0 references

    Identifiers