Edge searching weighted graphs

DOI10.1016/j.dam.2008.11.011zbMath1220.05055OpenAlexW1985522690MaRDI QIDQ1026157

Öznur Yaşar, David A. Pike, Danny Dyer, Margo Kondratieva

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.011

zbMATH Keywords

monotonicitypathwidthedge searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Signed and weighted graphs (05C22)

Related Items (max. 100)

Connected searching of weighted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. X: Obstructions to tree-decomposition
• The vertex separation number of a graph equals its path-width
• The vertex separation and search number of a graph
• Graph searching, elimination trees, and a generalization of bandwidth
• Searching and pebbling
• On the Cutwidth and the Topological Bandwidth of a Tree
• Topological Bandwidth
• The complexity of searching a graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Edge searching weighted graphs