The following pages link to Searching and pebbling (Q1821562):
Displaying 49 items.
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Intruder alert! Optimization models for solving the mobile robot graph-clear problem (Q1617399) (← links)
- Step-wise tile assembly with a constant number of tile types (Q1761741) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- On the domination search number (Q1811076) (← links)
- Directed tree-width (Q1850539) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- The treewidth of proofs (Q2013559) (← links)
- One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- Contiguous search problem in Sierpiński graphs (Q2272196) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Lower bounds on the pathwidth of some grid-like graphs (Q2476243) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- On Rerouting Connection Requests in Networks with Shared Bandwidth (Q2839218) (← links)
- The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
- Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- Decontamination of hypercubes by mobile agents (Q3184603) (← links)
- (Q3390712) (← links)
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY (Q3444837) (← links)
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (Q3444846) (← links)
- Memory requirements for table computations in partial k-tree algorithms (Q5054858) (← links)
- (Q5874536) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
