LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS

DOI10.1142/S0129054112500104zbMATH Open1255.68115OpenAlexW2962883699MaRDI QIDQ4902885FDOQ4902885

Authors Liang Hu, Meng Zhang, Yi Zhang, Jijun Tang 

Publication date 18 January 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054112500104

zbMATH Keywords

distributed algorithmsautomationgraph explorationlabeling scheme

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• Automaten in planaren Graphen
• Fast periodic graph exploration with constant memory
• Graph exploration by a finite automaton
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Setting port numbers for fast graph exploration
• The power of a pebble: Exploring and mapping directed graphs
• Tree exploration with advice
• Tree exploration with little memory

Cited In (1)

• Predicting the labels of an unknown graph via adaptive exploration

This page was built for publication: LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902885)