Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/2346
Назив: | A CLP approach for solving the maximum clique problem: Benefits and limits | Аутори: | Badica A. Badica C. Ivanović, Mirjana Logofatu D. |
Датум издавања: | 13-нов-2017 | Часопис: | 2017 21st International Conference on System Theory, Control and Computing, ICSTCC 2017 | Сажетак: | © 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. | URI: | https://open.uns.ac.rs/handle/123456789/2346 | ISBN: | 9781538638422 | DOI: | 10.1109/ICSTCC.2017.8107103 |
Налази се у колекцијама: | PMF Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
2
проверено 10.05.2024.
Преглед/и станица
11
Протекла недеља
1
1
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.