scientific article; zbMATH DE number 3650583
From MaRDI portal
Publication:3208679
Cited in
(31)- Lower bounds for the capture time: linear, quadratic, and beyond
- Lower and upper competitive bounds for online directed graph exploration
- Pathwidth is NP-Hard for Weighted Trees
- Escaping offline searchers and isoperimetric theorems
- The capture time of a planar graph
- Locating a robber with multiple probes
- Fugitive-search games on graphs and related parameters
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
- Cleaning a network with brushes
- Outerplanar obstructions for a feedback vertex set
- A property of random walks on a cycle graph
- Obstructions for tree-depth
- Outerplanar obstructions for the feedback vertex set
- On the Cooperative Graph Searching Problem
- The cost of monotonicity in distributed graph searching
- A linear fixed parameter tractable algorithm for connected pathwidth
- Forbidden graphs for tree-depth
- Min Cut is NP-complete for edge weighted trees
- Connected graph searching
- Edge and node searching problems on trees
- An annotated bibliography on guaranteed graph searching
- A game of cops and robbers
- Exclusive graph searching
- Cops and robber on oriented graphs with respect to push operation
- On minimizing width in linear layouts
- Search and sweep numbers of finite directed acyclic graphs
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- Resource finding in store-and-forward networks
- Fugitive-search games on graphs and related parameters
- A variation on the min cut linear arrangement problem
- Narrowness, pathwidth, and their application in natural language processing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208679)
