Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/2346
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Badica A. | en |
dc.contributor.author | Badica C. | en |
dc.contributor.author | Ivanović, Mirjana | en |
dc.contributor.author | Logofatu D. | en |
dc.date.accessioned | 2019-09-23T10:21:04Z | - |
dc.date.available | 2019-09-23T10:21:04Z | - |
dc.date.issued | 2017-11-13 | en |
dc.identifier.isbn | 9781538638422 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/2346 | - |
dc.description.abstract | © 2017 IEEE. Maximal Clique and Maximum Clique are two related and famous computational problems known to be intractable in the most general case. We propose a formulation of the Maximal Clique problem as a Boolean Satisfaction problem. The constraints are then mapped to a Constraint Logic Programming representation. The resulting representation can be input to a Constraint Logic Programming system that can be used in combination with a suitable Branch-and-Bound search strategy to compute the Clique Number and the Maximum Clique of a given undirected graph. We present initial experimental results that we obtained with this approach by utilizing ECLiPSe-CLP as target implementation platform. We also discuss the potential benefits, as well as the limitations, of this approach. | en |
dc.relation.ispartof | 2017 21st International Conference on System Theory, Control and Computing, ICSTCC 2017 | en |
dc.title | A CLP approach for solving the maximum clique problem: Benefits and limits | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1109/ICSTCC.2017.8107103 | en |
dc.identifier.scopus | 2-s2.0-85040538185 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85040538185 | en |
dc.relation.lastpage | 617 | en |
dc.relation.firstpage | 613 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0003-1946-0384 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
2
checked on May 10, 2024
Page view(s)
11
Last Week
1
1
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.