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