The following pages link to Sambhu Charan Barman (Q1034977):
Displaying 12 items.
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Scattering of flexural-gravity waves by a crack in a floating ice sheet due to mode conversion during blocking (Q3389427) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
- The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
- (Q6112063) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)
- Edge-vertex domination of acyclic trapezoid graphs: algorithm and complexity (Q6599559) (← links)
