The complexity of searching a graph
From MaRDI portal
Publication:3777477
Recommendations
- The complexity of searching succinctly represented graphs
- Search problems on graphs
- SOFSEM 2006: Theory and Practice of Computer Science
- The complexity of searching implicit graphs
- scientific article; zbMATH DE number 1538872
- scientific article; zbMATH DE number 15129
- Computational complexity of graphs
- On Graph Complexity
- On the optimality of a simple strategy for searching graphs
Cited in
(only showing first 100 items - show all)- The theory of guaranteed search on graphs
- Node-searching problem on block graphs
- Improved self-reduction algorithms for graphs with bounded treewidth
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- scientific article; zbMATH DE number 146433 (Why is no real title available?)
- scientific article; zbMATH DE number 1471731 (Why is no real title available?)
- Capture bounds for visibility-based pursuit evasion
- On minimizing width in linear layouts
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Escaping offline searchers and isoperimetric theorems
- A variation on the min cut linear arrangement problem
- Characterization of graphs and digraphs with small process numbers
- Distributed chasing of network intruders
- Positive semidefinite zero forcing: complexity and lower bounds
- Contiguous search problem in Sierpiński graphs
- scientific article; zbMATH DE number 4049076 (Why is no real title available?)
- Unbounded search and recursive graph problems
- On the Cooperative Graph Searching Problem
- A distributed algorithm for computing the node search number in trees
- One-visibility cops and robber on trees: optimal cop-win strategies
- SOFSEM 2006: Theory and Practice of Computer Science
- Mixed Search Number of Permutation Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- CSP duality and trees of bounded pathwidth
- Single step graph search problem
- Solving the single step graph searching problem by solving the maximum two-independent set problem
- Lower bounds for positive semidefinite zero forcing and their applications
- Search and sweep numbers of finite directed acyclic graphs
- Lower Bounds on Edge Searching
- Searching Cycle-Disjoint Graphs
- Finite graph automata for linear and boundary graph languages
- On a pursuit game played on graphs for which a minor is excluded
- Graph searching on chordal graphs
- The summation and bottleneck minimization for single-step searching on weighted graphs
- One-visibility cops and robber on trees
- The complexity of growing a graph
- Constrained graph searching on trees
- Exclusive graph searching
- scientific article; zbMATH DE number 3997549 (Why is no real title available?)
- A frame architecture for a certain class of graph search problems
- Distributed protocols against mobile eavesdroppers
- Edge searching and fast searching with constraints
- Exclusive graph searching vs. pathwidth
- The fast search number of a Cartesian product of graphs
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- Pathwidth is NP-Hard for Weighted Trees
- Fast-mixed searching and related problems on graphs
- Monotonicity in digraph search problems
- Fast searching games on graphs
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
- scientific article; zbMATH DE number 4002142 (Why is no real title available?)
- On Submodular Search and Machine Scheduling
- BOUNDARY-OPTIMAL TRIANGULATION FLOODING
- Pathwidth of Circular-Arc Graphs
- Graph automata for linear graph languages
- Non-deterministic graph searching in trees
- Fast edge searching and fast searching on graphs
- The complexity of pursuit on a graph
- Search in graphs
- Distributed graph searching with a sense of direction
- Pathwidth of outerplanar graphs
- Fugitive-search games on graphs and related parameters
- Searching expenditure and interval graphs
- Connected graph searching in chordal graphs
- The zero-visibility cops and robber game on graph products
- The cost of monotonicity in distributed graph searching
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Fast searching on \(k\)-combinable graphs
- Edge search number of cographs
- scientific article; zbMATH DE number 33703 (Why is no real title available?)
- On-line search in two-dimensional environment
- Edge Search Number of Cographs in Linear Time
- scientific article; zbMATH DE number 2220912 (Why is no real title available?)
- Search for the end of a path in the \(\cdot\)-dimensional grid and in other graphs
- Robust shortest path planning and semicontractive dynamic programming
- A 3-approximation for the pathwidth of Halin graphs
- An annotated bibliography on guaranteed graph searching
- Graph searching with advice
- Mixed searching and proper-path-width
- scientific article; zbMATH DE number 1472189 (Why is no real title available?)
- The search and the node-search number of dual graphs
- Locating a robber with multiple probes
- Complexity of node coverage games
- Resource finding in store-and-forward networks
- The searchlight problem for road networks
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- Four-searchable biconnected outerplanar graphs
- Network decontamination with a single agent
- Decontamination of hypercubes by mobile agents
- Searching with mobile agents in networks with liars.
- A two-person game on graphs where each player tries to encircle his opponent's men
- Minimal trees of given search number
- Fast searching on complete \(k\)-partite graphs
- Fast searching on Cartesian products of graphs
- Cooperative exploration and protection of a workspace assisted by information networks
- Monotonicity of strong searching on digraphs
- Approximate search strategies for weighted trees
- A graph search algorithm for indoor pursuit/evasion
- Monotonicity of Non-deterministic Graph Searching
This page was built for publication: The complexity of searching a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777477)
