Статті в журналах з теми "K-clique problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "K-clique problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Wu, Jun, and Minghao Yin. "A Restart Local Search for Solving Diversified Top-k Weight Clique Search Problem." Mathematics 9, no. 21 (October 21, 2021): 2674. http://dx.doi.org/10.3390/math9212674.
Повний текст джерелаLee, Chuan-Min. "Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs." Algorithms 14, no. 1 (January 13, 2021): 22. http://dx.doi.org/10.3390/a14010022.
Повний текст джерелаSanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi, and Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques." ACM Transactions on Knowledge Discovery from Data 15, no. 5 (June 26, 2021): 1–21. http://dx.doi.org/10.1145/3446637.
Повний текст джерелаSun, Bintao, Maximilien Danisch, T.-H. Hubert Chan, and Mauro Sozio. "KClist++." Proceedings of the VLDB Endowment 13, no. 10 (June 2020): 1628–40. http://dx.doi.org/10.14778/3401960.3401962.
Повний текст джерелаSzabó, Sándor, and Bogdán Zaválnij. "Clique Search in Graphs of Special Class and Job Shop Scheduling." Mathematics 10, no. 5 (February 23, 2022): 697. http://dx.doi.org/10.3390/math10050697.
Повний текст джерелаWu, Jun, and Minghao Yin. "A Hybrid Evolutionary Algorithm for the Diversified Top-k Weight Clique Search Problem (Student Abstract)." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 11 (June 28, 2022): 13083–84. http://dx.doi.org/10.1609/aaai.v36i11.21678.
Повний текст джерелаConte, Alessio, Donatella Firmani, Maurizio Patrignani, and Riccardo Torlone. "A meta-algorithm for finding large k-plexes." Knowledge and Information Systems 63, no. 7 (May 1, 2021): 1745–69. http://dx.doi.org/10.1007/s10115-021-01570-8.
Повний текст джерелаDEKEL, YAEL, ORI GUREL-GUREVICH, and YUVAL PERES. "Finding Hidden Cliques in Linear Time with High Probability." Combinatorics, Probability and Computing 23, no. 1 (November 14, 2013): 29–49. http://dx.doi.org/10.1017/s096354831300045x.
Повний текст джерелаMcCreesh, Ciaran, and Patrick Prosser. "Finding Maximum k-Cliques Faster Using Lazy Global Domination." Proceedings of the International Symposium on Combinatorial Search 7, no. 1 (September 1, 2021): 72–80. http://dx.doi.org/10.1609/socs.v7i1.18387.
Повний текст джерелаGoldschmidt, Oliver, Dorit S. Hochbaum, Cor Hurkens, and Gang Yu. "Approximation Algorithms for the k-Clique Covering Problem." SIAM Journal on Discrete Mathematics 9, no. 3 (August 1996): 492–509. http://dx.doi.org/10.1137/s089548019325232x.
Повний текст джерелаLiazi, Maria, Ioannis Milis, Fanny Pascual, and Vassilis Zissimopoulos. "The densest k-subgraph problem on clique graphs." Journal of Combinatorial Optimization 14, no. 4 (March 21, 2007): 465–74. http://dx.doi.org/10.1007/s10878-007-9069-1.
Повний текст джерелаSuyudi, Mochamad, Asep K. Supriatna, and Sukono Sukono. "Alternative Branching Strategies in the Branch and Bound Algorithm by Using a k-clique covering vertex set for Maximum Clique Problems." International Journal of Quantitative Research and Modeling 1, no. 4 (December 5, 2020): 208–16. http://dx.doi.org/10.46336/ijqrm.v1i4.82.
Повний текст джерелаSuyudi, Mochamad, Asep K. Supriatna, and Sukono Sukono. "Alternative Branching Strategies in the Branch and Bound Algorithm by Using a k-clique covering vertex set for Maximum Clique Problems." International Journal of Quantitative Research and Modeling 1, no. 4 (December 5, 2020): 208–16. http://dx.doi.org/10.46336/ijqrm.v1i4.82.
Повний текст джерелаSuyudi, Mochamad, Asep K. Supriatna, and Sukono Sukono. "Alternative Branching Strategies in the Branch and Bound Algorithm by Using a K-Clique Covering Vertex Set for Maximum Clique Problems." International Journal of Quantitative Research and Modeling 1, no. 4 (December 2, 2020): 208–16. http://dx.doi.org/10.46336/ijqrm.v1i4.92.
Повний текст джерелаMalod-Dognin, Noël, Rumen Andonov, and Nicola Yanev. "Solving Maximum Clique Problem for Protein Structure Similarity." Serdica Journal of Computing 4, no. 1 (March 31, 2010): 93–100. http://dx.doi.org/10.55630/sjc.2010.4.93-100.
Повний текст джерелаStern, Roni, Meir Kalech, and Ariel Felner. "Searching for a k-Clique in Unknown Graphs." Proceedings of the International Symposium on Combinatorial Search 1, no. 1 (August 25, 2010): 83–89. http://dx.doi.org/10.1609/socs.v1i1.18175.
Повний текст джерелаKoh, Yeong Jun, Yuk Heo, and Chang-Su Kim. "Sequential Clique Optimization for Unsupervised and Weakly Supervised Video Object Segmentation." Electronics 11, no. 18 (September 13, 2022): 2899. http://dx.doi.org/10.3390/electronics11182899.
Повний текст джерелаAmes, Brendan P. W., and Stephen A. Vavasis. "Convex optimization for the planted k-disjoint-clique problem." Mathematical Programming 143, no. 1-2 (December 7, 2013): 299–337. http://dx.doi.org/10.1007/s10107-013-0733-1.
Повний текст джерелаWu, Jun, Chu-Min Li, Lu Jiang, Junping Zhou, and Minghao Yin. "Local search for diversified Top-k clique search problem." Computers & Operations Research 116 (April 2020): 104867. http://dx.doi.org/10.1016/j.cor.2019.104867.
Повний текст джерелаZhou, Yi, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, and Yan Jin. "Enumerating Maximal k-Plexes with Worst-Case Time Guarantee." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 03 (April 3, 2020): 2442–49. http://dx.doi.org/10.1609/aaai.v34i03.5625.
Повний текст джерелаGupta, Anupam, David G. Harris, Euiwoong Lee, and Jason Li. "Optimal Bounds for the k -cut Problem." Journal of the ACM 69, no. 1 (February 28, 2022): 1–18. http://dx.doi.org/10.1145/3478018.
Повний текст джерелаTeixeira, Rafael B., and Celina M. Herrera de Figueiredo. "The sandwich problem for cutsets: Clique cutset, k-star cutset." Discrete Applied Mathematics 154, no. 13 (August 2006): 1791–98. http://dx.doi.org/10.1016/j.dam.2006.03.023.
Повний текст джерелаYANG, GANG, ZHENG TANG, ZHIQIANG ZHANG, and YUNYI ZHU. "A FLEXIBLE ANNEALING CHAOTIC NEURAL NETWORK TO MAXIMUM CLIQUE PROBLEM." International Journal of Neural Systems 17, no. 03 (June 2007): 183–92. http://dx.doi.org/10.1142/s0129065707001056.
Повний текст джерелаCzumaj, Artur, and Christian Konrad. "Detecting cliques in CONGEST networks." Distributed Computing 33, no. 6 (December 21, 2019): 533–43. http://dx.doi.org/10.1007/s00446-019-00368-w.
Повний текст джерелаLiang, Zuosong, Erfang Shan, and Liying Kang. "The clique-transversal set problem in {claw, K 4 }-free planar graphs." Information Processing Letters 118 (February 2017): 64–68. http://dx.doi.org/10.1016/j.ipl.2016.10.001.
Повний текст джерелаLi, Changhong. "Multi-objective Optimization Overlapping Community Detection Algorithm based on Subgraph Structure." Frontiers in Computing and Intelligent Systems 3, no. 3 (May 17, 2023): 110–12. http://dx.doi.org/10.54097/fcis.v3i3.8580.
Повний текст джерелаGao, Jian, Zhenghang Xu, Ruizhi Li, and Minghao Yin. "An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 10174–83. http://dx.doi.org/10.1609/aaai.v36i9.21257.
Повний текст джерелаWang, Zhaocai, Zuwen Ji, Lei Li, and Dongmei Huang. "A Parallel Computational Algorithm for Solving the Maximum k-Vertex Weighted Clique Problem." Journal of Computational and Theoretical Nanoscience 12, no. 12 (December 1, 2015): 6002–5. http://dx.doi.org/10.1166/jctn.2015.4749.
Повний текст джерелаPIKHURKO, OLEG, KATHERINE STADEN, and ZELEALEM B. YILMA. "The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques." Mathematical Proceedings of the Cambridge Philosophical Society 163, no. 2 (January 23, 2017): 341–56. http://dx.doi.org/10.1017/s0305004116001031.
Повний текст джерелаBOUAJJANI, AHMED, and AGATHE MERCERON. "Parametric Verification of a Group Membership Algorithm." Theory and Practice of Logic Programming 6, no. 3 (May 2006): 321–53. http://dx.doi.org/10.1017/s1471068406002663.
Повний текст джерелаAngelini, Patrizio, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra, and Alessandra Tappini. "Graph Planarity by Replacing Cliques with Paths." Algorithms 13, no. 8 (August 13, 2020): 194. http://dx.doi.org/10.3390/a13080194.
Повний текст джерелаSALEH, SAGVAN ALI, and MHAND HIFI. "A FAST METHOD FOR OPTIMIZING THE K-CLUSTERING BI-CLIQUE COMPLETION PROBLEM IN TELECOMMUNICATION." Journal of The University of Duhok 20, no. 1 (July 20, 2017): 175–83. http://dx.doi.org/10.26682/sjuod.2017.20.1.16.
Повний текст джерелаChen, Jiejiang, Yiyuan Wang, Shaowei Cai, Minghao Yin, Yupeng Zhou, and Jieyu Wu. "NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 10146–55. http://dx.doi.org/10.1609/aaai.v36i9.21254.
Повний текст джерелаLai, Wenxing. "The Inapproximability of k-DominatingSet for Parameterized AC 0 Circuits †." Algorithms 12, no. 11 (November 4, 2019): 230. http://dx.doi.org/10.3390/a12110230.
Повний текст джерелаWu, Kuixian, Jian Gao, Rong Chen, and Xianji Cui. "Vertex Selection Heuristics in Branch-and-Bound Algorithms for the Maximum k-Plex Problem." International Journal on Artificial Intelligence Tools 28, no. 05 (August 2019): 1950015. http://dx.doi.org/10.1142/s0218213019500155.
Повний текст джерелаFang, Zhiwen, Chu-Min Li, and Ke Xu. "An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem." Journal of Artificial Intelligence Research 55 (March 31, 2016): 799–833. http://dx.doi.org/10.1613/jair.4953.
Повний текст джерелаFomin, Fedor V., and Petr A. Golovach. "Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs." Algorithmica 83, no. 7 (April 11, 2021): 2170–214. http://dx.doi.org/10.1007/s00453-021-00822-x.
Повний текст джерелаde Melo, Alexsander A., Celina M. H. de Figueiredo, and Uéverton S. Souza. "On the Computational Difficulty of the Terminal Connection Problem." RAIRO - Theoretical Informatics and Applications 57 (2023): 3. http://dx.doi.org/10.1051/ita/2023002.
Повний текст джерелаMaksimenko, Aleksandr N. "Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm." Modeling and Analysis of Information Systems 27, no. 1 (March 23, 2020): 72–85. http://dx.doi.org/10.18255/1818-1015-2020-1-72-85.
Повний текст джерелаZhou, Yi, Shan Hu, Mingyu Xiao, and Zhang-Hua Fu. "Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (May 18, 2021): 12453–60. http://dx.doi.org/10.1609/aaai.v35i14.17477.
Повний текст джерелаKarapetyan, Iskandar. "On the restrictive channel thickness estimation." Facta universitatis - series: Electronics and Energetics 20, no. 3 (2007): 499–506. http://dx.doi.org/10.2298/fuee0703499k.
Повний текст джерелаKoutris, Paraschos, and Shaleen Deep. "The Fine-Grained Complexity of CFL Reachability." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 1713–39. http://dx.doi.org/10.1145/3571252.
Повний текст джерелаBuchin, Kevin, Sariel Har-Peled, and Dániel Oláh. "A Spanner for the Day After." Discrete & Computational Geometry 64, no. 4 (August 6, 2020): 1167–91. http://dx.doi.org/10.1007/s00454-020-00228-6.
Повний текст джерелаGunda, Spoorthy, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale. "On the Parameterized Approximability of Contraction to Classes of Chordal Graphs." ACM Transactions on Computation Theory 13, no. 4 (December 31, 2021): 1–40. http://dx.doi.org/10.1145/3470869.
Повний текст джерелаPandurangan, Gopal, Peter Robinson, and Michele Scquizzato. "On the Distributed Complexity of Large-Scale Graph Computations." ACM Transactions on Parallel Computing 8, no. 2 (June 30, 2021): 1–28. http://dx.doi.org/10.1145/3460900.
Повний текст джерелаChang, Lijun, Mouyi Xu, and Darren Strash. "Efficient maximum k -plex computation over large sparse graphs." Proceedings of the VLDB Endowment 16, no. 2 (October 2022): 127–39. http://dx.doi.org/10.14778/3565816.3565817.
Повний текст джерелаVilakone, Phonexay, and Doo-Soon Park. "The Efficiency of a DoParallel Algorithm and an FCA Network Graph Applied to Recommendation System." Applied Sciences 10, no. 8 (April 23, 2020): 2939. http://dx.doi.org/10.3390/app10082939.
Повний текст джерелаConiglio, Stefano, and Stefano Gualandi. "Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming." INFORMS Journal on Computing 34, no. 2 (March 2022): 1006–23. http://dx.doi.org/10.1287/ijoc.2021.1115.
Повний текст джерелаBhasker, J., and Tariq Samad. "The clique-partitioning problem." Computers & Mathematics with Applications 22, no. 6 (1991): 1–11. http://dx.doi.org/10.1016/0898-1221(91)90001-k.
Повний текст джерелаGANDHI, RAJIV, BRADFORD GREENING, SRIRAM PEMMARAJU, and RAJIV RAMAN. "SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS." Discrete Mathematics, Algorithms and Applications 02, no. 03 (September 2010): 331–45. http://dx.doi.org/10.1142/s1793830910000693.
Повний текст джерела