Single step searching in weighted block graphs
DOI10.1016/0020-0255(94)90086-8zbMATH Open0837.68083OpenAlexW2028362529MaRDI QIDQ1894239FDOQ1894239
Authors: Ruay-Shiung Chang, Ju-Yuan Hsiao, Chuan Yi Tang, R. C. T. Lee 
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
Recommendations
bottleneck minimizationstep graph searching problemsstep searching weighted graphssummation minimization
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- A Characterization of Block-Graphs
- On chain and antichain families of a partially ordered set
- Title not available (Why is that?)
- 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
- An Optimal Algorithm for the Maximum Two-Chain Problem
Cited In (6)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- An annotated bibliography on guaranteed graph searching
- Edge searching weighted graphs
- Node-searching problem on block graphs
- 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
This page was built for publication: Single step searching in weighted block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894239)
