معرفی
Dr. Patrick Prosser is an Honorary Lecturer in the School of Computing Science at the University of Glasgow. His research focuses on constraint programming, graph algorithms, and combinatorial optimization, particularly addressing challenging problems like subgraph isomorphism and maximum clique detection.
Recent work develops specialized solvers for graph problems and investigates empirical hardness in optimization. He has created novel approaches for parallel constraint solving and solution-biased search techniques. Dr. Prosser's Glasgow Subgraph Solver represents a significant contribution to handling difficult variants of subgraph isomorphism problems.
Publications explore parallel branch-and-bound methods, the impact of search tree structure on algorithm efficiency, and symmetry breaking techniques in graph representation. His work has applications in graph databases and combinatorial problem solving.
