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) |
||
| 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) |
Revision as of 14:59, 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)