Contiguous search problem in Sierpiński graphs
From MaRDI portal
Publication:2272196
DOI10.1007/s00224-008-9116-zzbMath1192.68200OpenAlexW2061600070WikidataQ57832107 ScholiaQ57832107MaRDI QIDQ2272196
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
Related Items (4)
Complex networks modeled on the Sierpinski gasket ⋮ The cost of monotonicity in distributed graph searching ⋮ Network decontamination under \(m\)-immunity ⋮ Gathering of robots in a ring with mobile faults
Cites Work
- Unnamed Item
- Graph minors. I. Excluding a forest
- The vertex separation and search number of a graph
- Fugitive-search games on graphs and related parameters
- Searching and pebbling
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Connected Treewidth and Connected Graph Searching
- Distributed Chasing of Network Intruders
- Graph minors. II. Algorithmic aspects of tree-width
- The complexity of searching a graph
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- Intruder Capture in Sierpiński Graphs
- Fractality and the small-world effect in Sierpinski graphs
- Algorithms and Computation
This page was built for publication: Contiguous search problem in Sierpiński graphs