Edge searching weighted graphs

DOI10.1016/J.DAM.2008.11.011MaRDI QIDQ1026157zbMATH OpenOpenAlexFDO

Authors O. Yaşar, Danny Dyer, David A. Pike, 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)

Recommendations

• Connected searching of weighted trees
• Connected searching of weighted trees
• Lower Bounds on Edge Searching
• Distributed graph searching with a sense of direction
• Single step searching in weighted block graphs

Cites work

• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Graph minors. X: Obstructions to tree-decomposition
• Graph searching, elimination trees, and a generalization of bandwidth
• Monotonicity in graph searching
• On the Cutwidth and the Topological Bandwidth of a Tree
• Recontamination does not help to search a graph
• Searching and pebbling
• Searching is not jumping.
• The complexity of searching a graph
• The vertex separation and search number of a graph
• The vertex separation number of a graph equals its path-width
• Topological Bandwidth

Cited in

(6)

• Single step searching in weighted block graphs
• Connected searching of weighted trees
• Distributed graph searching with a sense of direction
• Connected searching of weighted trees
• scientific article; zbMATH DE number 1471731 (Why is no real title available?)
• Edge Weight Reduction Problems in Directed Acyclic Graphs

This page was built for publication: Edge searching weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026157)