add refs

docs/source/conf.py

@@ -63,6 +63,7 @@
 # -- Bibfiles
 bibtex_bibfiles = [
     "refs/graphs.bib",
+    "refs/mwis_mwc.bib",
     "refs/opf.bib",
     "refs/portfolio.bib",
     "refs/qubo.bib",

docs/source/mods/mwis_mwc.rst

@@ -2,12 +2,12 @@ Maximum Weighted Independent Set/Clique
 =========================================
 The maximum independent set problem and its complement, the maximum
 clique are among fundamental problems in combinatorial optimization with ubiquitous
-applications and connections to other problems [REF].
+applications and connections to other problems (:footcite:t:`bomze1999maximum,wu2015review`).
 
 In this Mod, we consider the more general problems of the maximum weighted
 independent set and maximum weighted clique which have applications
 in various fields such as computer vision, pattern recognition,
-molecular structure matching, social network analysis, and genome data mapping [REF].
+molecular structure matching, social network analysis, and genome data mapping.
 To better understand how a theoretical graph theory
 problem can be used to address a real-world challenge, let us review one
 application area for each problem in detail.
@@ -168,3 +168,5 @@ blue, respectively.
 
 .. image:: figures/mwis_mwc.png
   :width: 600
+
+.. footbibliography::

docs/source/refs/mwis_mwc.bib

@@ -0,0 +1,19 @@
+@article{bomze1999maximum,
+  title={The maximum clique problem},
+  author={Bomze, Immanuel M and Budinich, Marco and Pardalos, Panos M and Pelillo, Marcello},
+  journal={Handbook of Combinatorial Optimization: Supplement Volume A},
+  pages={1--74},
+  year={1999},
+  publisher={Springer}
+}
+
+@article{wu2015review,
+  title={A review on algorithms for maximum clique problems},
+  author={Wu, Qinghua and Hao, Jin-Kao},
+  journal={European Journal of Operational Research},
+  volume={242},
+  number={3},
+  pages={693--709},
+  year={2015},
+  publisher={Elsevier}
+}