-
Notifications
You must be signed in to change notification settings - Fork 4
/
paper.bib
90 lines (82 loc) · 2.49 KB
/
paper.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
@article{shah2020jcol,
doi = {10.21105/joss.01843},
url = {https://doi.org/10.21105/joss.01843},
year = {2020},
publisher = {The Open Journal},
volume = {5},
number = {48},
pages = {1843},
author = {Shalin Shah},
title = {JCOL: A Java package for solving the graph coloring problem},
journal = {Journal of Open Source Software}
}
@article{pardalos1994maximum,
title={The maximum clique problem},
author={Pardalos, Panos M and Xue, Jue},
journal={Journal of global Optimization},
volume={4},
number={3},
pages={301--328},
year={1994},
publisher={Springer}
}
@incollection{bomze1999maximum,
title={The maximum clique problem},
author={Bomze, Immanuel M and Budinich, Marco and Pardalos, Panos M and Pelillo, Marcello},
booktitle={Handbook of combinatorial optimization},
pages={1--74},
year={1999},
publisher={Springer}
}
@article{OSTERGARD2002197,
title = "A fast algorithm for the maximum clique problem",
journal = "Discrete Applied Mathematics",
volume = "120",
number = "1",
pages = "197 - 207",
year = "2002",
note = "Special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization",
issn = "0166-218X",
doi = "https://doi.org/10.1016/S0166-218X(01)00290-6",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X01002906",
author = "Patric R.J. Ostergard",
}
@article{WU2015693,
title = "A review on algorithms for maximum clique problems",
journal = "European Journal of Operational Research",
volume = "242",
number = "3",
pages = "693 - 709",
year = "2015",
issn = "0377-2217",
doi = "https://doi.org/10.1016/j.ejor.2014.09.064",
url = "http://www.sciencedirect.com/science/article/pii/S0377221714008030",
author = "Qinghua Wu and Jin-Kao Hao",
keywords = "Maximum clique problems, Exact algorithms, Heuristics, Applications",
}
@misc{shah2016randomized,
title={Randomized heuristic for the maximum clique problem},
author={Shah, Shalin},
url={https://github.com/shah314/clique2},
year={2016},
DOI={10.5281/zenodo.3818578},
publisher={Zenodo}
}
@misc{shah2020gclique,
title={GCLIQUE: A Genetic Algorithm for the Maximum Clique Problem},
url={https://github.com/shah314/clique},
author={Shah, Shalin},
year={2020},
publisher={JOSS}
}
@misc{dimacsinstances,
url={http://iridia.ulb.ac.be/~fmascia/maximum_clique/DIMACS-benchmark},
title={Dimacs Instances},
year={2000}
}
@book{dharwadker2006clique,
title={The clique algorithm},
author={Dharwadker, Ashay},
year={2006},
publisher={Institute of Mathematics}
}