I am currently working on a ticketing kind of application

and one of the desired features, is searching a bay of seats for the largest group.

so im wondering are there any kind of algorithms or whatever that searches over a 2d graph and can spit out the largest group of available seats?

any tips welcome

thanks