A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fast Algorithm for Finding Maximum Clique in Scale-Free Networks

2016
*
Conference on Theory and Practice of Information Technologies
*

The maximum clique problem in graph theory concerns finding the largest subset of vertices in which all vertices are connected with an edge. Computation of such subset is a well-known NP-hard problem and there exist many algorithms to solve it. For our purposes we created an algorithm specially targeted for solving this problem in scale-free networks, where many significant search improvements may be introduced. We use the general purpose algorithm developed by Östergård in 2002 as subroutine

dblp:conf/itat/Jursa16
fatcat:7sxl33qznfawfghyyv7jan2xfu