scientific article; zbMATH DE number 3590298
From MaRDI portal
Publication:4159394
zbMath0379.05026MaRDI QIDQ4159394
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Toward multi-target self-organizing pursuit in a partially observable Markov game ⋮ Connected search for a lazy robber ⋮ Fast searching on \(k\)-combinable graphs ⋮ Edge searching and fast searching with constraints ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ Unnamed Item ⋮ Learning through imitation by using formal verification ⋮ Fugitive-search games on graphs and related parameters ⋮ Fast two-robot disk evacuation with wireless communication ⋮ On-line search in two-dimensional environment ⋮ Searching by heterogeneous agents ⋮ Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers ⋮ Intruder alert! Optimization models for solving the mobile robot graph-clear problem ⋮ The realizability problem for Golovach-type functions ⋮ Positive Alexander Duality for Pursuit and Evasion ⋮ A polynomial time algorithm to compute the connected treewidth of a series-parallel graph ⋮ Network decontamination with a single agent ⋮ The capture time of a planar graph ⋮ Subdivisions in the robber locating game ⋮ On the Cooperative Graph Searching Problem ⋮ Cooperative pursuit with Voronoi partitions ⋮ A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Jumping robbers in digraphs ⋮ Min Cut is NP-complete for edge weighted trees ⋮ How many lions are needed to clear a grid? ⋮ Edge Search Number of Cographs in Linear Time ⋮ Pathwidth is NP-Hard for Weighted Trees ⋮ Multiagent cooperative learning strategies for pursuit-evasion games ⋮ Locating a robber with multiple probes ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ On minimum cost edge searching ⋮ Locating a robber on a graph via distance queries ⋮ Visibility-based pursuit-evasion in a polygonal environment ⋮ Outerplanar obstructions for matroid pathwidth ⋮ \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas ⋮ Fugitive-search games on graphs and related parameters ⋮ Helicopter search problems, bandwidth and pathwidth ⋮ On a characterization of evasion strategies for pursuit-evasion games on graphs ⋮ Lions and contamination: monotone clearings ⋮ Mixed Search Number of Permutation Graphs ⋮ The complexity of zero-visibility cops and robber ⋮ Edge search number of cographs ⋮ Monotonicity of Non-deterministic Graph Searching ⋮ Mixed Search Number and Linear-Width of Interval and Split Graphs ⋮ The mixed search game against an agile and visible fugitive is monotone ⋮ Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas ⋮ Network decontamination under \(m\)-immunity ⋮ Fast searching on cactus graphs ⋮ Tradeoffs in process strategy games with application in the WDM reconfiguration problem ⋮ The theory of guaranteed search on graphs ⋮ Clearing an orthogonal polygon to find the evaders ⋮ Three-fast-searchable graphs ⋮ Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem ⋮ Zero forcing in iterated line digraphs ⋮ Time constrained graph searching ⋮ Monotonicity of non-deterministic graph searching ⋮ Cleaning a network with brushes ⋮ An annotated bibliography on guaranteed graph searching ⋮ Distributed chasing of network intruders ⋮ A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity ⋮ Single step graph search problem ⋮ Solving the single step graph searching problem by solving the maximum two-independent set problem ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons ⋮ The complexity of pursuit on a graph ⋮ Mixed searching and proper-path-width ⋮ Four-searchable biconnected outerplanar graphs ⋮ Escaping offline searchers and isoperimetric theorems ⋮ The vertex separation number of a graph equals its path-width ⋮ Cooperative exploration and protection of a workspace assisted by information networks ⋮ The fast search number of a Cartesian product of graphs ⋮ Connected graph searching ⋮ Search and sweep numbers of finite directed acyclic graphs ⋮ Connected graph searching in chordal graphs ⋮ A graph search algorithm for indoor pursuit/evasion ⋮ Unnamed Item ⋮ Finite graph automata for linear and boundary graph languages ⋮ Maximum vertex occupation time and inert fugitive: Recontamination does help ⋮ Connected searching of weighted trees ⋮ Minimal trees of given search number ⋮ Mixed search number and linear-width of interval and split graphs ⋮ Exclusive graph searching vs. pathwidth ⋮ A property of random walks on a cycle graph ⋮ Graph searching with advice ⋮ On minimizing width in linear layouts ⋮ Pursuit of a Moving Target with Known Constant Speed on a Directed Acyclic Graph under Partial Information ⋮ Minimal trees of a given search number ⋮ Guarding a subgraph as a tool in pursuit-evasion games ⋮ A witness version of the cops and robber game ⋮ Edge searching weighted graphs ⋮ Searching and pebbling ⋮ A two-person game on graphs where each player tries to encircle his opponent's men ⋮ Edge and node searching problems on trees ⋮ Lions and contamination, triangular grids, and Cheeger constants ⋮ Vertex-to-vertex pursuit in a graph ⋮ Finding small-width connected path decompositions in polynomial time ⋮ Sweeping graphs with large clique number ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ A game of cops and robbers
This page was built for publication:
