McCreesh, C., Ndiaye, S. N., Prosser, P. and Solnon, C. (2016) Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. In: CP2016: The 22nd International Conference on Principles and Practice of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 350-368. ISBN 9783319449524 (doi: 10.1007/978-3-319-44953-1_23)
|
Text
120631.pdf - Accepted Version 697kB |
Abstract
The maximum common subgraph problem is to find the largest subgraph common to two given graphs. This problem can be solved either by constraint-based search, or by reduction to the maximum clique problem. We evaluate these two models using modern algorithms, and see that the best choice depends mainly upon whether the graphs have labelled edges. We also study a variant of this problem where the subgraph is required to be connected. We introduce a filtering algorithm for this property and show that it may be combined with a restricted branching technique for the constraint-based approach. We show how to implement a similar branching technique in clique-inspired algorithms. Finally, we experimentally compare approaches for the connected version, and see again that the best choice depends on whether graphs have labels
Item Type: | Conference Proceedings |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Mccreesh, Dr Ciaran and Prosser, Dr Patrick |
Authors: | McCreesh, C., Ndiaye, S. N., Prosser, P., and Solnon, C. |
College/School: | College of Science and Engineering > School of Computing Science |
ISSN: | 0302-9743 |
ISBN: | 9783319449524 |
Published Online: | 23 August 2016 |
Copyright Holders: | Copyright © 2016 Springer International Publishing |
First Published: | First published in Lecture Notes in Computer Science 9892: 350-368 |
Publisher Policy: | Reproduced in accordance with the publisher copyright policy |
Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record