The robot crawler graph process
From MaRDI portal
Publication:1671307
DOI10.1016/j.dam.2018.01.018zbMath1394.05114OpenAlexW2884836385WikidataQ57991411 ScholiaQ57991411MaRDI QIDQ1671307
Calum MacRury, Kirill Ternovsky, Xavier Pérez-Giménez, Rita M. del Río-Chanona, Anthony Bonato, Paweł Prałat, Jake Nicolaidis
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
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
- The robot cleans up
- Cleaning a network with brushes
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Efficiently searching a graph by a smell-oriented vertex process
- Complexity of Langton's ant
- A distributed ant algorithm for efficiently patrolling a network
- The diameter of a scale-free random graph
- Bounds on the cleaning times of robot vacuums
- The degree sequence of a scale-free random graph process
- Geometric Protean Graphs
- The Structure of Geographical Threshold Graphs
- A Spatial Web Graph Model with Local Influence Regions
- Emergence of Scaling in Random Networks
- The Robot Crawler Number of a Graph
- Introduction to Information Retrieval
- Note on the heights of random recursive trees and random m‐ary search trees
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- Algorithmic Challenges in Web Search Engines
- Cleaning Regular Graphs with Brushes
- Web Crawling
- Scale‐free graphs of increasing degree
This page was built for publication: The robot crawler graph process
