Solving the single step graph searching problem by solving the maximum two-independent set problem
From MaRDI portal
Publication:1183488
DOI10.1016/0020-0190(91)90124-ZzbMath0743.68109MaRDI QIDQ1183488
Chuan Yi Tang, Ruay-Shiung Chang, Ju-Yuan Hsiao
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90124-z
Related Items
Maximum weightk-independent set problem on permutation graphs, An annotated bibliography on guaranteed graph searching, An efficient algorithm for finding a maximum weight 2-independent set on interval graphs, The summation and bottleneck minimization for single-step searching on weighted graphs, Single step searching in weighted block graphs, A sequential algorithm for finding a maximum weightK-independent set on interval graphs
Cites Work