A Partitioning Algorithm for Maximum Common Subgraph Problems

Ciaran McCreesh, P. P., & Trimble, J. (2017). A Partitioning Algorithm for Maximum Common Subgraph Problems. IJCAI 2017, 712-719.

Type

Conference paper

Intellectual base

Primary research

Year

2017

DOI

10.24963/ijcai.2017/89

Link

https://doi.org/10.24963/ijcai.2017/89

Cited by

1 citation across 1 artifact.

Domain-specific

• Modular product of graphs
  • Solver certificates and bounds concern the product, but the reported scientific result is the recovered common induced structure.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3a254595b5ea · see in the full table