Author:
Tomita Etsuji,Yoshida Kohei,Hatta Takuro,Nagao Atsuki,Ito Hiro,Wakatsuki Mitsuo
Publisher
Springer International Publishing
Reference21 articles.
1. Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27, 397–416 (2014)
2. http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm
3. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Supplement, vol. A, pp. 1–74. Kluwer Academic Publishers, Boston (1999)
4. Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375–382 (1990)
5. Fujii, T., Tomita, E.: On efficient algorithms for finding a maximum clique, Technical report of IECE, AL81-113, 25–34 (1982)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fairness-Aware Maximal Clique in Large Graphs: Concepts and Algorithms;IEEE Transactions on Knowledge and Data Engineering;2023-11-01
2. Speeding-Up Construction Algorithms for the Graph Coloring Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01
3. Online Removable Knapsack Problem for Integer-Sized Unweighted Items;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01
4. Maximal-Clique Problem Formulation for Common Structure Detection in Many Graphs;2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC);2022-07-05
5. Fairness-aware Maximal Clique Enumeration;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05