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)- Graph searching with advice
- Edge searching weighted graphs
- Standard directed search strategies and their applications
- Sweeping graphs with large clique number
- On a pursuit game played on graphs for which a minor is excluded
- Single step graph search problem
- Solving the single step graph searching problem by solving the maximum two-independent set problem
- Search and sweep numbers of finite directed acyclic graphs
- A two-person game on graphs where each player tries to encircle his opponent's men
- On the pathwidth of chordal graphs
- The summation and bottleneck minimization for single-step searching on weighted graphs
- Improved self-reduction algorithms for graphs with bounded treewidth
- Some generalizations of the problem on the search number of a graph
- Complexity of searching an immobile hider in a graph
- Fugitive-search games on graphs and related parameters
- On the monotonicity of games generated by symmetric submodular functions.
- Searching with mobile agents in networks with liars.
- Edge and node searching problems on trees
- Algorithms and obstructions for linear-width and related search parameters
- Nontrivial discontinuities of the Golovach functions for trees
- Finite graph automata for linear and boundary graph languages
- The fast search number of a complete \(k\)-partite graph
- Minimal trees of a given search number
- Searching and pebbling
- Directed tree-width
- Approximate search strategies for weighted trees
- How to survive while visiting a graph
- An NP-completeness result of edge search in graphs
- Computing the one-visibility copnumber of trees
- One-visibility cops and robber on trees: optimal cop-win strategies
- Computing the one-visibility cop-win strategies for trees
- One-visibility cops and robber on trees
- Four-searchable biconnected outerplanar graphs
- Cooperative exploration and protection of a workspace assisted by information networks
- Contiguous search problem in Sierpiński graphs
- Characterization of graphs and digraphs with small process numbers
- Complexity of node coverage games
- Non-deterministic graph searching in trees
- Linear rank-width and linear clique-width of trees
- The searchlight problem for road networks
- Distributed graph searching with a sense of direction
- The cost of monotonicity in distributed graph searching
- Locating a robber with multiple probes
- Monotonicity of strong searching on digraphs
- A distributed algorithm for computing the node search number in trees
- The theory of guaranteed search on graphs
- Three-fast-searchable graphs
- Node-searching problem on block graphs
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- Fast searching on cactus graphs
- The search and the node-search number of dual graphs
- Network decontamination with a single agent
- The complexity of the positive semidefinite zero forcing
- Fast searching on complete k-partite graphs
- Fast searching on Cartesian products of graphs
- Mixed search number and linear-width of interval and split graphs
- Robust shortest path planning and semicontractive dynamic programming
- Decontamination of hypercubes by mobile agents
- Lower and upper competitive bounds for online directed graph exploration
- More agents may decrease global work: a case in butterfly decontamination
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Pathwidth of outerplanar graphs
- Positive semidefinite zero forcing: complexity and lower bounds
- Mixed Search Number of Permutation Graphs
- Monotonicity of Non-deterministic Graph Searching
- Pathwidth of Circular-Arc Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- INTRUDER CAPTURING IN MESH AND TORUS NETWORKS
- Lower Bounds on Edge Searching
- Searching Cycle-Disjoint Graphs
- scientific article; zbMATH DE number 4002142 (Why is no real title available?)
- scientific article; zbMATH DE number 4049076 (Why is no real title available?)
- A variation on the min cut linear arrangement problem
- A frame architecture for a certain class of graph search problems
- Fast-mixed searching and related problems on graphs
- scientific article; zbMATH DE number 33703 (Why is no real title available?)
- scientific article; zbMATH DE number 146433 (Why is no real title available?)
- Fast searching games on graphs
- Edge search number of cographs
- Searching expenditure and interval graphs
- scientific article; zbMATH DE number 1471731 (Why is no real title available?)
- scientific article; zbMATH DE number 1472189 (Why is no real title available?)
- Graph automata for linear graph languages
- scientific article; zbMATH DE number 3997549 (Why is no real title available?)
- scientific article; zbMATH DE number 749657 (Why is no real title available?)
- Capture bounds for visibility-based pursuit evasion
- Network decontamination with temporal immunity by cellular automata
- On the Cooperative Graph Searching Problem
- Unbounded search and recursive graph problems
- Visibility-based pursuit-evasion in a polygonal environment
- On Submodular Search and Machine Scheduling
- Lower bounds for positive semidefinite zero forcing and their applications
- Bounding the search number of graph products
- Exclusive graph searching
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- The fast search number of a Cartesian product of graphs
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Edge Search Number of Cographs in Linear Time
- Pathwidth is NP-Hard for Weighted Trees
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)
