Single step searching in weighted block graphs
From MaRDI portal
Publication:1894239
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A Characterization of Block-Graphs
- An Optimal Algorithm for the Maximum Two-Chain Problem
- 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
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)