Difference between revisions of "Research interests"
From Combinatorics Wiki
(Created page with " == MAIN RESEARCH AREAS == Graph Theory (algorithms, degree-diameter problem, graph labelling, applications of graph theory to network design and security issues) Computatio...") |
(→MAIN RESEARCH AREAS) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 2: | Line 2: | ||
== MAIN RESEARCH AREAS == | == MAIN RESEARCH AREAS == | ||
| − | Graph Theory (algorithms, degree-diameter problem, graph labelling, applications of graph theory to network design and security issues) | + | * Graph Theory (algorithms, degree-diameter problem, graph labelling, applications of graph theory to network design, social networks and security issues) |
| − | Computational Group and Monoid Theory (algorithms for computing with finitely presented monoids and groups) | + | * Computational Group and Monoid Theory (algorithms for computing with finitely presented monoids and groups) |
| − | Image Processing and Computer Vision (Voronoi image models, image | + | * Image Processing and Computer Vision (Voronoi image models, image segmentation) |
Latest revision as of 15:11, 6 June 2020
MAIN RESEARCH AREAS
- Graph Theory (algorithms, degree-diameter problem, graph labelling, applications of graph theory to network design, social networks and security issues)
- Computational Group and Monoid Theory (algorithms for computing with finitely presented monoids and groups)
- Image Processing and Computer Vision (Voronoi image models, image segmentation)