Contiguous search problem in Sierpiński graphs

DOI10.1007/S00224-008-9116-ZzbMATH Open1192.68200OpenAlexW2061600070WikidataQ57832107 ScholiaQ57832107MaRDI QIDQ2272196FDOQ2272196

Authors: Flaminia L. Luccio 

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9116-z

Recommendations

• Intruder Capture in Sierpiński Graphs
• Distributed chasing of network intruders
• Searching and sweeping graphs: a brief survey
• Time constrained graph searching
• Searching for an intruder on graphs and their subdivisions

zbMATH Keywords

mobile agentsintruder captureSierpiński graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cites Work

• Spanning trees of finite Sierpiński graphs
• Searching and pebbling
• Connected Treewidth and Connected Graph Searching
• Graph minors. II. Algorithmic aspects of tree-width
• The complexity of searching a graph
• Recontamination does not help to search a graph
• Graph minors. I. Excluding a forest
• The vertex separation and search number of a graph
• Fugitive-search games on graphs and related parameters
• Monotonicity in graph searching
• Fractality and the small-world effect in Sierpinski graphs
• DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
• Distributed Chasing of Network Intruders
• Algorithms and Computation
• Intruder Capture in Sierpiński Graphs

Cited In (6)

• The cost of monotonicity in distributed graph searching
• Intruder Capture in Sierpiński Graphs
• Gathering of robots in a ring with mobile faults
• Network decontamination under \(m\)-immunity
• Complex networks modeled on the Sierpinski gasket
• Capturing an Intruder in the Pyramid

This page was built for publication: Contiguous search problem in Sierpiński graphs

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