The summation and bottleneck minimization for single-step searching on weighted graphs

DOI10.1016/0020-0255(93)90125-6zbMath0783.68093OpenAlexW2053349965MaRDI QIDQ1310944

Chuan Yi Tang, Ju-Yuan Hsiao, Ruay-Shiung Chang

Publication date: 13 January 1994

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90125-6

zbMATH Keywords

trees\(NP\)-hardbottleneck cost minimizationsearching problemsingle-step graphsummation cost minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Single step searching in weighted block graphs ⋮ An annotated bibliography on guaranteed graph searching

Cites Work

• Single step graph search problem
• Solving the single step graph searching problem by solving the maximum two-independent set problem
• The complexity of searching a graph
• Unnamed Item

This page was built for publication: The summation and bottleneck minimization for single-step searching on weighted graphs