Author:
Belachew Melisew Tefera,Gillis Nicolas
Funder
Fonds De La Recherche Scientifique - FNRS
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference27 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
2. Luce, R.D., Perry, A.D.: A method for matrix analysis of group structure. Psychometrika 14, 94–114 (1949)
3. Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6, 281–297 (1999)
4. Sugihara, G.: Graph theory, homology and food webs. Proc. Symp. Appl. Math. 30, 83–101 (1984)
5. Prihar, Z.: Topological properties of telecommunication networks. Proc. IRE 44, 927–933 (1956)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CLIPPER+: A Fast Maximal Clique Algorithm for Robust Global Registration;IEEE Robotics and Automation Letters;2024-04
2. Pyramid Semantic Graph-Based Global Point Cloud Registration with Low Overlap;2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2023-10-01
3. Finding Network Motifs: A comparative study between ILP and Symmetric Rank-One NMF;2023 3rd International Conference on Intelligent Technologies (CONIT);2023-06-23
4. SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via $$s^+$$-index;The Journal of Supercomputing;2022-12-12
5. DESTINE;Proceedings of the 30th ACM International Conference on Information & Knowledge Management;2021-10-26