Edge searching weighted graphs
type: Item
instance of: scholarly article
title: Edge searching weighted graphs
zbMATH Open document ID: 1220.05055
author: O. Yaşar
author: Danny Dyer
author: David A. Pike
author: Margo Kondratieva
published in: Discrete Applied Mathematics
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5569478
zbMATH Keywords: edge searching
zbMATH Keywords: monotonicity
zbMATH Keywords: pathwidth
MaRDI profile type: Publication
full work available at URL: j.dam.2008.11.011
OpenAlex ID: W1985522690
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Monotonicity in graph searching
cites work: On the Cutwidth and the Topological Bandwidth of a Tree
cites work: The vertex separation and search number of a graph
cites work: Graph searching, elimination trees, and a generalization of bandwidth
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: Topological Bandwidth
cites work: The complexity of searching a graph
cites work: Q4159394
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Q4869540
DOI: 10.1016/J.DAM.2008.11.011
description: scientific article; zbMATH DE number 5569478