64 results on '"Panda, B. S."'
Search Results
2. Evaluation and Detection of Breast Cancer Using Data Mining Models
3. Apply Rough Set Methods to Preserve Social Networks Privacy—A Review
4. On the Complexity of Minimum Maximal Acyclic Matchings
5. On Two Variants of Induced Matchings
6. Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs
7. Hardness Results of Global Roman Domination in Graphs
8. Hardness and Approximation Results of Roman {3}-Domination in Graphs
9. Acyclic Matching in Some Subclasses of Graphs
10. Identifying Influential Spreaders On a Weighted Network Using HookeRank Method
11. On the Complexity of Minimum Maximal Uniquely Restricted Matching
12. Hardness Results of Global Total k-Domination Problem in Graphs
13. Dominating Induced Matching in Some Subclasses of Bipartite Graphs
14. Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking
15. Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three
16. Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs
17. On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs
18. Induced Matching in Some Subclasses of Bipartite Graphs
19. Link prediction in complex networks using node centrality and light gradient boosting machine
20. Adjacent vertex distinguishing total coloring of the corona product of graphs
21. b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results
22. Domination in Some Subclasses of Bipartite Graphs
23. Algorithmic Aspects of Disjunctive Domination in Graphs
24. Separator Theorems for Interval Graphs and Proper Interval Graphs
25. Rough Set Rule-Based Technique for the Retrieval of Missing Data in Malaria Diseases Diagnosis
26. Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
27. A Study of Incomplete Data – A Review
28. MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks
29. IM-ELPR: Influence maximization in social networks using label propagation based community structure
30. QoS Multicast Routing Using Teaching Learning Based Optimization
31. Community detection in complex networks using network embedding and gravitational search algorithm
32. Modeling information diffusion in online social networks using a modified forest-fire model
33. Strong Minimum Interference Topology for Wireless Sensor Networks
34. An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks
35. Heuristic Algorithms for the L(2,1)-Labeling Problem
36. On the total and AVD-total coloring of graphs
37. A Novel Concept and Review on Retrieval of Missing Data
38. A Method for Classification of Missing Values using Data Mining Techniques
39. Analysis of social network metrics based on the model of random recursive tree
40. Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids
41. A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees
42. An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs
43. A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees
44. Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems
45. An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems
46. METHODS AND CONCEPTS OF DATA MINING TECHNIQUES TO IMPUTE MISSING DATA INFORMATION
47. New heuristics for strong minimum energy topology with reduced time complexity
48. Algorithmic aspects of b-disjunctive domination in graphs
49. On the dominator coloring in proper interval graphs and block graphs
50. A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.