scientific article
From MaRDI portal
Publication:4035355
zbMath0777.05090MaRDI QIDQ4035355
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Localization game on geometric and planar graphs, The cost of monotonicity in distributed graph searching, A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth, How many lions are needed to clear a grid?, Edge Search Number of Cographs in Linear Time, Triangulating graphs without asteroidal triples, Approximate search strategies for weighted trees, Fugitive-search games on graphs and related parameters, Helicopter search problems, bandwidth and pathwidth, Connected search for a lazy robber, Fast searching games on graphs, Fast searching on \(k\)-combinable graphs, Edge searching and fast searching with constraints, Fast Searching on Complete k-partite Graphs, Minimum rank and zero forcing number for butterfly networks, Mixed Search Number of Permutation Graphs, Edge search number of cographs, Mixed Search Number and Linear-Width of Interval and Split Graphs, Monotonicity of strong searching on digraphs, Edge degeneracy: algorithmic and structural results, On the monotonicity of games generated by symmetric submodular functions., Network decontamination under \(m\)-immunity, Fast searching on cactus graphs, The theory of guaranteed search on graphs, Fast Searching on Cartesian Products of Graphs, Monotonicity of non-deterministic graph searching, The role of information in the cop-robber game, Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning, An annotated bibliography on guaranteed graph searching, Distributed chasing of network intruders, Centroidal localization game, The complexity of minimum-length path decompositions, Node-searching problem on block graphs, Digraph searching, directed vertex separation and directed pathwidth, A 3-approximation for the pathwidth of Halin graphs, Exclusive graph searching, Lower bounds on the pathwidth of some grid-like graphs, The fast search number of a Cartesian product of graphs, Connected graph searching, Fugitive-search games on graphs and related parameters, Connected graph searching in chordal graphs, Slightly Superexponential Parameterized Problems, Finite graph automata for linear and boundary graph languages, On the interval completion of chordal graphs, Using a hybrid of exact and genetic algorithms to design survivable networks, Monotony properties of connected visible graph searching, The fast search number of a complete \(k\)-partite graph, Graph searching with advice, Unnamed Item, On the domination search number, Nondeterministic graph searching: from pathwidth to treewidth, A partial k-arboretum of graphs with bounded treewidth, Searching for a Visible, Lazy Fugitive, Edge and node searching problems on trees, Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth, Searching expenditure and interval graphs
