Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-016-1043-6
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Wu, Qinghua & Hao, Jin-Kao, 2015. "A review on algorithms for maximum clique problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 693-709.
- Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015.
"Heuristics for exact nonnegative matrix factorization,"
LIDAM Discussion Papers CORE
2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- VANDAELE, Arnaud & GILLIS, Nicolas & GLINEUR, François & TUYTTENS, Daniel, 2016. "Heuristics for Exact Nonnegative Matrix Factorization," LIDAM Reprints CORE 2737, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Nicolas Gillis & François Glineur, 2014.
"A continuous characterization of the maximum-edge biclique problem,"
Journal of Global Optimization, Springer, vol. 58(3), pages 439-464, March.
- GILLIS, Nicolas & GLINEUR, François, 2014. "A continuous characterization of the maximum-edge biclique problem," LIDAM Reprints CORE 2567, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- R. Luce & Albert Perry, 1949. "A method of matrix analysis of group structure," Psychometrika, Springer;The Psychometric Society, vol. 14(2), pages 95-116, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Oleksandra Yezerska & Sergiy Butenko & Vladimir L. Boginski, 2018. "Detecting robust cliques in graphs subject to uncertain edge failures," Annals of Operations Research, Springer, vol. 262(1), pages 109-132, March.
- Alessio Troiani, 2024. "Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem," Mathematics, MDPI, vol. 12(18), pages 1-16, September.
- Immanuel M. Bomze & Francesco Rinaldi & Damiano Zeffiro, 2021. "Frank–Wolfe and friends: a journey into projection-free first-order optimization methods," 4OR, Springer, vol. 19(3), pages 313-345, September.
- Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
- Laurent, Monique & Vargas, Luis Felipe, 2022. "Finite convergence of sum-of-squares hierarchies for the stability number of a graph," Other publications TiSEM 3998b864-7504-4cf4-bc1d-f, Tilburg University, School of Economics and Management.
- Foad Mahdavi Pajouh, 2020. "Minimum cost edge blocker clique problem," Annals of Operations Research, Springer, vol. 294(1), pages 345-376, November.
- Zhu, Yongjun & Yan, Erjia, 2017. "Examining academic ranking and inequality in library and information science through faculty hiring networks," Journal of Informetrics, Elsevier, vol. 11(2), pages 641-654.
- Zhou, Yi & Lin, Weibo & Hao, Jin-Kao & Xiao, Mingyu & Jin, Yan, 2022. "An effective branch-and-bound algorithm for the maximum s-bundle problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 27-39.
- Etienne Farvaque & Frédéric Gannon, 2018.
"Profiling giants: the networks and influence of Buchanan and Tullock,"
Public Choice, Springer, vol. 175(3), pages 277-302, June.
- Etienne Farvaque & Frédéric Gannon, 2020. "Profiling giants: The networks and influence of Buchanan and Tullock," Working Papers halshs-02474745, HAL.
- Vanhaverbeke, W.P.M. & Beerkens, B.E. & Duysters, G.M., 2003.
"Explorative and exploitative learning strategies in technology-based alliance networks,"
Working Papers
03.22, Eindhoven Center for Innovation Studies.
- Wim Vanhaverbeke & Bonnie Beerkens & Geert Duysters & Victor Gilsing, 2006. "Explorative and exploitative learning strategies in technology-based alliance networks," Working Papers 06-03, Eindhoven Center for Innovation Studies, revised Jan 2006.
- K. Parthasarathy, 1964. "Enumeration of paths in digraphs," Psychometrika, Springer;The Psychometric Society, vol. 29(2), pages 153-165, June.
- Nasirian, Farzaneh & Mahdavi Pajouh, Foad & Balasundaram, Balabhaskar, 2020. "Detecting a most closeness-central clique in complex networks," European Journal of Operational Research, Elsevier, vol. 283(2), pages 461-475.
- Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
- Luzhi Wang & Shuli Hu & Mingyang Li & Junping Zhou, 2019. "An Exact Algorithm for Minimum Vertex Cover Problem," Mathematics, MDPI, vol. 7(7), pages 1-8, July.
- Zhou, Yi & Rossi, André & Hao, Jin-Kao, 2018. "Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs," European Journal of Operational Research, Elsevier, vol. 269(3), pages 834-843.
- William Ray Arney, 1973. "A Refined Status Index for Sociometric Data," Sociological Methods & Research, , vol. 1(3), pages 329-346, February.
- Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
- Zhong, Haonan & Mahdavi Pajouh, Foad & A. Prokopyev, Oleg, 2023. "On designing networks resilient to clique blockers," European Journal of Operational Research, Elsevier, vol. 307(1), pages 20-32.
- Wang, Yang & Wu, Qinghua & Glover, Fred, 2017. "Effective metaheuristic algorithms for the minimum differential dispersion problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 829-843.
- Rota Bulò, Samuel & Pelillo, Marcello, 2017. "Dominant-set clustering: A review," European Journal of Operational Research, Elsevier, vol. 262(1), pages 1-13.
More about this item
Keywords
Maximum clique problem; Motzkin–Straus formulation; Symmetric rank-one non-negative matrix approximation; Clique finding algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:173:y:2017:i:1:d:10.1007_s10957-016-1043-6. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.