Name
Abstract | ||
|---|---|---|
There are well established widely used benchmark tests to assess the performance of practical exact clique search algorithms. In this paper a family of further benchmark problems is proposed mainly to test exhaustive clique search procedures. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.31449/inf.v43i2.2678 | INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS |
Keywords | Field | DocType |
clique, maximal clique, maximum clique, graph coloring, random graph, Mycielski graph | Mathematical optimization,Search algorithm,Clique,Computer science,Theoretical computer science | Journal |
Volume | Issue | ISSN |
43 | 2 | 0350-5596 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sándor Szabó | 1 | 10 | 5.11 |
| Bogdán Zaválnij | 2 | 0 | 0.34 |