Strong-mixed searching and pathwidth
type: Item
instance of: scholarly article
title: Strong-mixed searching and pathwidth
zbMATH Open document ID: 1112.90039
author: Boting Yang
published in: Journal of Combinatorial Optimization
publication date: 2007-02-14T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 91A23
zbMATH DE Number: 5126742
zbMATH Keywords: Node search
zbMATH Keywords: Edge search
zbMATH Keywords: Mixed search
zbMATH Keywords: Cops-and-robber game
zbMATH Keywords: Pursuit-evasion problem
MaRDI profile type: Publication
full work available at URL: s10878-006-9013-9
OpenAlex ID: W2059837177
cites work: Q3418339
cites work: Monotonicity in graph searching
cites work: Eavesdropping games
cites work: The vertex separation number of a graph equals its path-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: Graph minors. I. Excluding a forest
cites work: Mixed searching and proper-path-width
DOI: 10.1007/S10878-006-9013-9
description: scientific article; zbMATH DE number 5126742