Ammanamanchi Srinivasa Murthy

Learn More
Presents a novel and efficient genetic approach for finding maximal cliques in a graph. A binary alphabet has been chosen to represent the presence or absence of nodes in a subgraph. The approach is to start with an initial population having small sized graphs, and then to effectively generate larger ones using a new crossover mechanism called`partial copy(More)
  • 1