A basic algorithm for graph reconstruction

MaRDI QIDQ2879993zbMATH OpenFDO

Authors E. A. Tatarinov

Publication date 10 April 2012

Published in Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki (Search for Journal in Brave)

zbMATH Keywords

agentedge portgraph reconstractionmove on graphnod mark

Mathematics Subject Classification ID

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

Recommendations

• Reconstruction of a labeled graph by a graph-walking mobile agent
• About the upper bound of the resulting graph reconstruction obtained by graph-component connections
• Exploration of a finite graph by a collective of agents
• Spectrum of graph recovery algorithms with a moving agent
• Using a collective of agents for exploration of undirected graphs

Cited in

(5)

• A linear algorithm for restructuring a graph
• Reconstruction Algorithm for Permutation Graphs
• About the upper bound of the resulting graph reconstruction obtained by graph-component connections
• Reconstruction of a labeled graph by a graph-walking mobile agent
• Spectrum of graph recovery algorithms with a moving agent

This page was built for publication: A basic algorithm for graph reconstruction

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