The robot crawler graph process

DOI10.1016/J.DAM.2018.01.018MaRDI QIDQ1671307zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez, Paweł Prałat, Kirill Ternovsky

Publication date 6 September 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2018.01.018

zbMATH Keywords

random graphgraph searchingpreferential attachment modeldeterministic walk

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27)

Recommendations

• The Robot Crawler Number of a Graph
• Crawling on Simple Models of Web Graphs
• Algorithms and Models for the Web-Graph
• Web crawling
• A random-surfer web-graph model

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A distributed ant algorithm for efficiently patrolling a network
• A spatial web graph model with local influence regions
• Algorithmic Challenges in Web Search Engines
• Bounds on the cleaning times of robot vacuums
• Cleaning a network with brushes
• Cleaning regular graphs with brushes
• Complex graphs and networks
• Complexity of Langton's ant
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Efficiently searching a graph by a smell-oriented vertex process
• Emergence of Scaling in Random Networks
• Geometric protean graphs
• Introduction to Information Retrieval
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Note on the heights of random recursive trees and random m‐ary search trees
• Perfect matchings and Hamiltonian cycles in the preferential attachment model
• Scale-free graphs of increasing degree
• The Robot Crawler Number of a Graph
• The degree sequence of a scale-free random graph process
• The diameter of a scale-free random graph
• The game of cops and robbers on graphs
• The robot cleans up
• The structure of geographical threshold graphs
• Web crawling

Cited in

(2)

• The Robot Crawler Number of a Graph
• The robot crawler model on complete \(k\)-partite and Erdős-Rényi random graphs

This page was built for publication: The robot crawler graph process

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