The robot crawler graph process

DOI10.1016/J.DAM.2018.01.018zbMATH Open1394.05114DBLPjournals/dam/BonatoRMNPPT18OpenAlexW2884836385WikidataQ57991411 ScholiaQ57991411MaRDI QIDQ1671307FDOQ1671307

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

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

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)

Cites Work

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

Cited In (2)

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

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)