Proximity Search For Maximal Subgraph Enumeration

Alessio Conte, Andrea Marino, Roberto Grossi +2

This paper proposes a new general technique for maximal subgraph enumeration which we call proximity search, whose aim is to design efficient enumeration algorithms for problems th…