Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon. Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. In Michel Rueher, editor, Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. Volume 9892 of Lecture Notes in Computer Science, pages 350-368, Springer, 2016. [doi]

The following publications are possibly variants of this publication:

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph ProblemsStephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble 0001. cp 2020: 338-357 [doi]

CP Models for Maximum Common Subgraph ProblemsSamba Ndojh Ndiaye, Christine Solnon. cp 2011: 637-644 [doi]

runs on WebDSL