29 results on '"Balasundaram, Balabhaskar"'
Search Results
2. On atomic cliques in temporal graphs
3. Graph signatures: Identification and optimization
4. Detecting a most closeness-central clique in complex networks
5. First passage time interdiction in Markov chains
6. On the chance-constrained minimum spanning k-core problem
7. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
8. Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
9. On the 2-Club Polytope of Graphs
10. Detecting large risk-averse 2-clubs in graphs with random edge failures
11. A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates
12. The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
13. Significant Winter Weather Events and Associated Socioeconomic Impacts (Federal Aid Expenditures) across Oklahoma : 2000–10
14. Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
15. An exact algorithm for the maximum probabilistic clique problem
16. A branch-and-bound approach for maximum quasi-cliques
17. On Fault-Tolerant Low-Diameter Clusters in Graphs.
18. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
19. On characterization of maximal independent sets via quadratic optimization
20. Variable objective search
21. Topology design for on-demand dual-path routing in wireless networks
22. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
23. On a Polynomial Fractional Formulation for Independence Number of a Graph
24. Novel Approaches for Analyzing Biological Networks
25. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.
26. An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph.
27. SNP variable selection by generalized graph domination.
28. Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection.
29. Constructing test functions for global optimization using continuous formulations of graph problems.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.