The following pages link to Sukumar Mondal (Q666517):
Displayed 18 items.
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs (Q1398021) (← links)
- Energy of interval-valued fuzzy graphs and its application in ecological systems (Q2089266) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- Computation of inverse 1-centre location problem on the weighted interval graphs (Q2224231) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs (Q4498117) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- (Q4718828) (← links)
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532) (← 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)