Spectrum of graph recovery algorithms with a moving agent

MaRDI QIDQ5746018zbMATH OpenFDO

Authors E. A. Tatarinov

Publication date 17 February 2014

zbMATH Keywords

graph recoverynumbering of graph verticesoptimization

Mathematics Subject Classification ID

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

Recommendations

• A basic algorithm for graph reconstruction
• Using a collective of agents for exploration of undirected 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
• Graph-Based Representations in Pattern Recognition

Cited in

(5)

• Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning
• A basic algorithm for graph reconstruction
• About the upper bound of the resulting graph reconstruction obtained by graph-component connections
• Graph-Based Representations in Pattern Recognition
• Reconstruction of a labeled graph by a graph-walking mobile agent

This page was built for publication: Spectrum of graph recovery algorithms with a moving agent

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