Monotonicity of non-deterministic graph searching
type: Item
instance of: scholarly article
title: Monotonicity of non-deterministic graph searching
zbMATH Open document ID: 1146.68060
author: Frédéric Mazoit
author: Nicolas Nisse
published in: Theoretical Computer Science
publication date: 2008-06-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5292230
zbMATH Keywords: graph searching
zbMATH Keywords: treewidth
zbMATH Keywords: monotonicity
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.02.036
OpenAlex ID: W2034927865
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Directed path-width and monotonicity in digraph searching
cites work: DAG-Width and Parity Games
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Fugitive-search games on graphs and related parameters
cites work: The vertex separation and search number of a graph
cites work: Mathematical Foundations of Computer Science 2005
cites work: Monotony Properties of Connected Visible Graph Searching
cites work: Directed tree-width
cites work: Searching and pebbling
cites work: Recontamination does not help to search a graph
cites work: The complexity of searching a graph
cites work: DAG-width
cites work: Q4159394
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Graph searching and a min-max theorem for tree-width
cites work: Algorithms and Computation
DOI: 10.1016/J.TCS.2008.02.036
description: scientific article; zbMATH DE number 5292230