Interval graphs and searching
From MaRDI portal
Recommendations
Cites work
Cited in
(65)- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
- Step-wise tile assembly with a constant number of tile types
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Fugitive-search games on graphs and related parameters
- On tradeoffs between width- and fill-like graph parameters
- Edge search number of cographs
- A linear-time approximation algorithm for the minimum-length geometric embedding of trees
- Edge Search Number of Cographs in Linear Time
- A 3-approximation for the pathwidth of Halin graphs
- An annotated bibliography on guaranteed graph searching
- The inverse Voronoi problem in graphs. I: Hardness
- Mixed searching and proper-path-width
- Maximum vertex occupation time and inert fugitive: Recontamination does help
- scientific article; zbMATH DE number 1472189 (Why is no real title available?)
- Searching for a Visible, Lazy Fugitive
- A partial k-arboretum of graphs with bounded treewidth
- Searching with mobile agents in networks with liars.
- Interval degree and bandwidth of a graph
- A linear fixed parameter tractable algorithm for connected pathwidth
- A cops and robber game and the meeting time of synchronous directed walks
- Approximate search strategies for weighted trees
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Directed tree-width
- Connected graph searching
- The complexity of zero-visibility cops and robber
- Edge and node searching problems on trees
- Quickly excluding a forest
- On the interval completion of chordal graphs
- Narrowness, pathwidth, and their application in natural language processing
- The vertex separation number of a graph equals its path-width
- Metric dimension parameterized by treewidth
- Interval graphs and related topics
- On the pathwidth of chordal graphs
- Graph searching and interval completion
- Fugitive-search games on graphs and related parameters
- How to hunt an invisible rabbit on a graph
- On the monotonicity of games generated by symmetric submodular functions.
- Pathwidth of 2-layer k-planar graphs
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- scientific article; zbMATH DE number 7651203 (Why is no real title available?)
- Algorithms and obstructions for linear-width and related search parameters
- The pathwidth and treewidth of cographs
- Mixed search number and linear-width of interval and split graphs
- Parameterized complexity of \((A,\ell)\)-path packing
- Computing the vertex separation of unicyclic graphs
- Jumping robbers in digraphs
- The theory of guaranteed search on graphs
- Node-searching problem on block graphs
- The complexity of minimum-length path decompositions
- Graph parameters, universal obstructions, and WQO
- Distributed chasing of network intruders
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
- Complexity results for a cops and robber game on directed graphs
- Connected search for a lazy robber
- Imbalance is fixed parameter tractable
- Excluding infinite minors
- Mixed Search Number of Permutation Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Finite graph automata for linear and boundary graph languages
- Graph searching on chordal graphs
- Zero-visibility cops and robber and the pathwidth of a graph
- Helicopter search problems, bandwidth and pathwidth
- Hardness of metric dimension in graphs of constant treewidth
This page was built for publication: Interval graphs and searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059088)
