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)- BOUNDARY-OPTIMAL TRIANGULATION FLOODING
- Monotonicity of Non-deterministic Graph Searching
- The search and the node-search number of dual graphs
- How to survive while visiting a graph
- Monotonicity in digraph search problems
- Approximate search strategies for weighted trees
- Computing the one-visibility copnumber of trees
- Pathwidth is NP-Hard for Weighted Trees
- Improved self-reduction algorithms for graphs with bounded treewidth
- Graph searching on chordal graphs
- Unbounded search and recursive graph problems
- A frame architecture for a certain class of graph search problems
- The searchlight problem for road networks
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
- Pathwidth of outerplanar graphs
- Standard directed search strategies and their applications
- A graph search algorithm for indoor pursuit/evasion
- A property of random walks on a cycle graph
- Graph automata for linear graph languages
- One-visibility cops and robber on trees: optimal cop-win strategies
- The summation and bottleneck minimization for single-step searching on weighted graphs
- Contiguous search problem in Sierpiński graphs
- Connected graph searching in chordal graphs
- On Submodular Search and Machine Scheduling
- Monotonicity of strong searching on digraphs
- Complexity of searching an immobile hider in a graph
- Edge searching weighted graphs
- The fast search number of a complete \(k\)-partite graph
- Bounding the search number of graph products
- One-visibility cops and robber on trees
- scientific article; zbMATH DE number 1472189 (Why is no real title available?)
- Single step graph search problem
- Solving the single step graph searching problem by solving the maximum two-independent set problem
- scientific article; zbMATH DE number 146433 (Why is no real title available?)
- The theory of guaranteed search on graphs
- scientific article; zbMATH DE number 1471731 (Why is no real title available?)
- The complexity of zero-visibility cops and robber
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- scientific article; zbMATH DE number 2220912 (Why is no real title available?)
- The complexity of the positive semidefinite zero forcing
- 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
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- Finite graph automata for linear and boundary graph languages
- Distributed protocols against mobile eavesdroppers
- Resource finding in store-and-forward networks
- Fugitive-search games on graphs and related parameters
- An NP-completeness result of edge search in graphs
- Robust shortest path planning and semicontractive dynamic programming
- A distributed algorithm for computing the node search number in trees
- Sweeping graphs with large clique number
- Fast-mixed searching and related problems on graphs
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Minimal trees of given search number
- Mixed searching and proper-path-width
- Lower and upper competitive bounds for online directed graph exploration
- More agents may decrease global work: a case in butterfly decontamination
- Algorithms and obstructions for linear-width and related search parameters
- Network decontamination with a single agent
- Searching and pebbling
- Exclusive graph searching vs. pathwidth
- Escaping offline searchers and isoperimetric theorems
- On a pursuit game played on graphs for which a minor is excluded
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- Fast searching games on graphs
- Distributed chasing of network intruders
- Locating a robber with multiple probes
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- On the complexity of the positive semidefinite zero forcing number
- Edge search number of cographs
- Fugitive-search games on graphs and related parameters
- Minimal trees of a given search number
- scientific article; zbMATH DE number 3997549 (Why is no real title available?)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem
- Cleaning a network with brushes
- Directed tree-width
- Pathwidth of Circular-Arc Graphs
- Lower Bounds on Edge Searching
- Searching Cycle-Disjoint Graphs
- Monotonicity of non-deterministic graph searching
- On the monotonicity of games generated by symmetric submodular functions.
- Three-fast-searchable graphs
- scientific article; zbMATH DE number 4049076 (Why is no real title available?)
- Fast searching on cactus graphs
- scientific article; zbMATH DE number 33703 (Why is no real title available?)
- Visibility-based pursuit-evasion in a polygonal environment
- Vision-Based Pursuit-Evasion in a Grid
- Network decontamination under \(m\)-immunity
- CSP duality and trees of bounded pathwidth
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Search in graphs
- Linear rank-width and linear clique-width of trees
- Digraph searching, directed vertex separation and directed pathwidth
- The cost of monotonicity in distributed graph searching
- Mixed search number and linear-width of interval and split graphs
- Parallel cleaning of a network with brushes
- Decontamination of hypercubes by mobile agents
- Characterization of graphs and digraphs with small process numbers
- Searching with mobile agents in networks with liars.
- Connected 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)
