Pages that link to "Item:Q1392025"

The following pages link to Fugitive-search games on graphs and related parameters (Q1392025):

Displaying 50 items.

• Contraction obstructions for connected graph searching (Q298950) (← links)
• Fast searching games on graphs (Q411259) (← links)
• The dag-width of directed graphs (Q444380) (← links)
• On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
• Approximation algorithms for digraph width parameters (Q476883) (← links)
• The complexity of minimum-length path decompositions (Q494076) (← links)
• Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
• A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
• Exclusive graph searching vs. pathwidth (Q729824) (← links)
• A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
• Directed elimination games (Q896668) (← links)
• Time constrained graph searching (Q930887) (← links)
• Monotonicity of non-deterministic graph searching (Q930888) (← links)
• Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
• Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
• An annotated bibliography on guaranteed graph searching (Q930895) (← links)
• Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
• Connected graph searching in chordal graphs (Q967304) (← links)
• Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
• Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
• Monotony properties of connected visible graph searching (Q999260) (← links)
• Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
• All structured programs have small tree width and good register allocation (Q1271620) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• Treewidth for graphs with small chordality (Q1372729) (← links)
• Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
• On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
• Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
• On the domination search number (Q1811076) (← links)
• On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
• Contiguous search problem in Sierpiński graphs (Q2272196) (← links)
• Linear rank-width and linear clique-width of trees (Q2346380) (← links)
• Static search games played over graphs and general metric spaces (Q2356189) (← links)
• Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
• Monotonicity of strong searching on digraphs (Q2426650) (← links)
• The theory of guaranteed search on graphs (Q2439841) (← links)
• Digraphs of bounded elimination width (Q2442210) (← links)
• Finding a moving fugitive. A game theoretic representation of search (Q2462540) (← links)
• Directed path-width and monotonicity in digraph searching (Q2502026) (← links)
• Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
• The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
• LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
• Decontamination of hypercubes by mobile agents (Q3184603) (← links)
• Graph Searching in a Crime Wave (Q3508551) (← links)
• Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
• Searching expenditure and interval graphs (Q4242800) (← links)
• A search game on the union of graphs with immobile hider (Q4859575) (← links)
• Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
• Searching for a Visible, Lazy Fugitive (Q5302068) (← links)