scientific article
From MaRDI portal
Publication:3208679
zbMath0418.05022MaRDI QIDQ3208679
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treescontinuous functionEuclidean 3-spacetopological invariantevadersearch numberpursuerspolyhedron of a finite graph
Related Items (31)
The capture time of a planar graph ⋮ The cost of monotonicity in distributed graph searching ⋮ On the Cooperative Graph Searching Problem ⋮ A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Min Cut is NP-complete for edge weighted trees ⋮ Pathwidth is NP-Hard for Weighted Trees ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Locating a robber with multiple probes ⋮ Fugitive-search games on graphs and related parameters ⋮ Outerplanar obstructions for a feedback vertex set ⋮ Forbidden graphs for tree-depth ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ A variation on the min cut linear arrangement problem ⋮ Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem ⋮ Cleaning a network with brushes ⋮ An annotated bibliography on guaranteed graph searching ⋮ Narrowness, pathwidth, and their application in natural language processing ⋮ Escaping offline searchers and isoperimetric theorems ⋮ Exclusive graph searching ⋮ Connected graph searching ⋮ Fugitive-search games on graphs and related parameters ⋮ Search and sweep numbers of finite directed acyclic graphs ⋮ A property of random walks on a cycle graph ⋮ On minimizing width in linear layouts ⋮ Resource finding in store-and-forward networks ⋮ Edge and node searching problems on trees ⋮ Outerplanar Obstructions for the Feedback Vertex Set ⋮ Obstructions for Tree-depth ⋮ A game of cops and robbers
This page was built for publication:
