Distributed chasing of network intruders

DOI10.1016/j.tcs.2008.02.004zbMath1146.68013OpenAlexW2151815677MaRDI QIDQ930899

Lélia Blin, Pierre Fraigniaud, Sandrine Vial, Nicolas Nisse

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.004

zbMATH Keywords

network securitydistributed algorithmgraph searching

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (11)

The cost of monotonicity in distributed graph searching ⋮ More agents may decrease global work: a case in butterfly decontamination ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents ⋮ Network decontamination under \(m\)-immunity ⋮ On mobile agent verifiable problems ⋮ Connected graph searching ⋮ On-line search in two-dimensional environment ⋮ Finding small-width connected path decompositions in polynomial time ⋮ Distributed graph searching with a sense of direction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On minimizing width in linear layouts
• Interval graphs and searching
• Automaten in planaren Graphen
• Searching and pebbling
• Graph exploration by a finite automaton
• Connected Treewidth and Connected Graph Searching
• Improved approximation algorithms for minimum-weight vertex separators
• Undirected ST-connectivity in log-space
• Complexity of Finding Embeddings in a k-Tree
• The complexity of searching a graph
• Space Lower Bounds for Maze Threadability on Restricted Machines
• Monotonicity in graph searching
• Searching for a black hole in arbitrary networks
• Recontamination does not help to search a graph
• STACS 2004
• Automata, Languages and Programming
• Mathematical Foundations of Computer Science 2005
• Algorithms and Computation
• Automata, Languages and Programming
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Distributed chasing of network intruders