Solving Graph Problems via Potential Maximal Cliques : An Experimental Evaluation of the Bouchitté-Todinca Algorithm

Show full item record



Permalink

http://hdl.handle.net/10138/309131

Citation

Korhonen , T , Berg , J & Järvisalo , M 2019 , ' Solving Graph Problems via Potential Maximal Cliques : An Experimental Evaluation of the Bouchitté-Todinca Algorithm ' , ACM Journal of Experimental Algorithmics , vol. 24 , no. 1 , 1.9 . https://doi.org/10.1145/3301297

Title: Solving Graph Problems via Potential Maximal Cliques : An Experimental Evaluation of the Bouchitté-Todinca Algorithm
Author: Korhonen, Tuukka; Berg, Jeremias; Järvisalo, Matti
Contributor organization: Department of Computer Science
Helsinki Institute for Information Technology
Constraint Reasoning and Optimization research group / Matti Järvisalo
Date: 2019-06
Language: eng
Number of pages: 19
Belongs to series: ACM Journal of Experimental Algorithmics
ISSN: 1084-6654
DOI: https://doi.org/10.1145/3301297
URI: http://hdl.handle.net/10138/309131
Subject: 113 Computer and information sciences
Peer reviewed: Yes
Usage restriction: openAccess
Self-archived version: acceptedVersion
Funder: Unknown funder
Grant number:


Files in this item

Total number of downloads: Loading...

Files Size Format View
paper.pdf 743.8Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record