Single step searching in weighted block graphs

DOI10.1016/0020-0255(94)90086-8zbMath0837.68083OpenAlexW2028362529MaRDI QIDQ1894239

Ruay-Shiung Chang, Richard Chia-Tung Lee, Chuan Yi Tang, Ju-Yuan Hsiao

Publication date: 10 August 1995

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

Full work available at URL: https://doi.org/10.1016/0020-0255(94)90086-8

zbMATH Keywords

bottleneck minimizationstep graph searching problemsstep searching weighted graphssummation minimization

Mathematics Subject Classification ID

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

Related Items (2)

The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ An annotated bibliography on guaranteed graph searching

Cites Work

• Unnamed Item
• Unnamed Item
• On chain and antichain families of a partially ordered set
• Single step graph search problem
• Solving the single step graph searching problem by solving the maximum two-independent set problem
• The summation and bottleneck minimization for single-step searching on weighted graphs
• A Characterization of Block-Graphs
• An Optimal Algorithm for the Maximum Two-Chain Problem

This page was built for publication: Single step searching in weighted block graphs