More efficient periodic traversal in anonymous undirected graphs (Q442265): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T42 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6064610 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithms and data structures | |||
Property / zbMATH Keywords: algorithms and data structures / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph exploration | |||
Property / zbMATH Keywords: graph exploration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
periodic graph traversal | |||
Property / zbMATH Keywords: periodic graph traversal / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
oblivious agent | |||
Property / zbMATH Keywords: oblivious agent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constant-memory agent | |||
Property / zbMATH Keywords: constant-memory agent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
three-layer partition | |||
Property / zbMATH Keywords: three-layer partition / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.035 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2174851824 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata and Labyrinths / 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: Structural Information and Communication Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / 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: Setting port numbers for fast graph exploration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Decomposition for Improving Memoryless Periodic Exploration / 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 | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:44, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | More efficient periodic traversal in anonymous undirected graphs |
scientific article |
Statements
More efficient periodic traversal in anonymous undirected graphs (English)
0 references
10 August 2012
0 references
algorithms and data structures
0 references
graph exploration
0 references
periodic graph traversal
0 references
oblivious agent
0 references
constant-memory agent
0 references
three-layer partition
0 references