The following pages link to Interval graphs and searching (Q1059088):
Displaying 50 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Edge search number of cographs (Q415273) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Connected graph searching (Q690489) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- Excluding infinite minors (Q1191928) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Searching with mobile agents in networks with liars. (Q1422406) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← 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)
- Directed tree-width (Q1850539) (← 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 inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- Hardness of metric dimension in graphs of constant treewidth (Q2093561) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Graph searching and interval completion (Q2706178) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- The pathwidth and treewidth of cographs (Q5056112) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
