Contiguous search problem in Sierpiński graphs

DOI10.1007/S00224-008-9116-ZMaRDI QIDQ2272196zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

mobile agentsintruder captureSierpiński graphs

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• Complex networks modeled on the Sierpinski gasket
• Gathering of robots in a ring with mobile faults
• Network decontamination under \(m\)-immunity
• The cost of monotonicity in distributed graph searching
• Intruder Capture in Sierpiński Graphs
• 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)