Home » Blog » Tags » isomorphism

isomorphism

8th TUC Meeting - Lijun Chang (University of New South Wales). Efficient Subgraph Matching by Postponing Cartesian Products.

  • Posted on: 11 January 2017
  • By: Adrian Diaz

Lijun Chang, DECRA Fellow at the University of New South Wales talked about how to make subgraph matching more efficient thanks to postponing Cartesian products. They key problem he explained was the extraction of subgraph isomorphic embeddings. The applications of this process are wide enough to cover protein interaction research, social network analysis and even chemical compound investigation. The testing of subgraph isomorphism is an NP-complete type of problem however, his team is focusing on enumerating all subgraph embeddings which, he explains, is even harder.

Pages