Pages that link to "Item:Q1183488"
From MaRDI portal
The following pages link to Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488):
Displayed 6 items.
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
- The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
- Single step searching in weighted block graphs (Q1894239) (← links)
- A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)