Literatura académica sobre el tema "K-clique problem"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "K-clique problem".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "K-clique problem"
Wu, Jun y Minghao Yin. "A Restart Local Search for Solving Diversified Top-k Weight Clique Search Problem". Mathematics 9, n.º 21 (21 de octubre de 2021): 2674. http://dx.doi.org/10.3390/math9212674.
Texto completoLee, Chuan-Min. "Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs". Algorithms 14, n.º 1 (13 de enero de 2021): 22. http://dx.doi.org/10.3390/a14010022.
Texto completoSanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi y Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques". ACM Transactions on Knowledge Discovery from Data 15, n.º 5 (26 de junio de 2021): 1–21. http://dx.doi.org/10.1145/3446637.
Texto completoSun, Bintao, Maximilien Danisch, T.-H. Hubert Chan y Mauro Sozio. "KClist++". Proceedings of the VLDB Endowment 13, n.º 10 (junio de 2020): 1628–40. http://dx.doi.org/10.14778/3401960.3401962.
Texto completoSzabó, Sándor y Bogdán Zaválnij. "Clique Search in Graphs of Special Class and Job Shop Scheduling". Mathematics 10, n.º 5 (23 de febrero de 2022): 697. http://dx.doi.org/10.3390/math10050697.
Texto completoWu, Jun y 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, n.º 11 (28 de junio de 2022): 13083–84. http://dx.doi.org/10.1609/aaai.v36i11.21678.
Texto completoConte, Alessio, Donatella Firmani, Maurizio Patrignani y Riccardo Torlone. "A meta-algorithm for finding large k-plexes". Knowledge and Information Systems 63, n.º 7 (1 de mayo de 2021): 1745–69. http://dx.doi.org/10.1007/s10115-021-01570-8.
Texto completoDEKEL, YAEL, ORI GUREL-GUREVICH y YUVAL PERES. "Finding Hidden Cliques in Linear Time with High Probability". Combinatorics, Probability and Computing 23, n.º 1 (14 de noviembre de 2013): 29–49. http://dx.doi.org/10.1017/s096354831300045x.
Texto completoMcCreesh, Ciaran y Patrick Prosser. "Finding Maximum k-Cliques Faster Using Lazy Global Domination". Proceedings of the International Symposium on Combinatorial Search 7, n.º 1 (1 de septiembre de 2021): 72–80. http://dx.doi.org/10.1609/socs.v7i1.18387.
Texto completoGoldschmidt, Oliver, Dorit S. Hochbaum, Cor Hurkens y Gang Yu. "Approximation Algorithms for the k-Clique Covering Problem". SIAM Journal on Discrete Mathematics 9, n.º 3 (agosto de 1996): 492–509. http://dx.doi.org/10.1137/s089548019325232x.
Texto completoTesis sobre el tema "K-clique problem"
Trukhanov, Svyatoslav. "Novel approaches for solving large-scale optimization problems on graphs". [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2986.
Texto completoCapítulos de libros sobre el tema "K-clique problem"
Katayama, Kengo, Masashi Sadamatsu y Hiroyuki Narihisa. "Iterated k-Opt Local Search for the Maximum Clique Problem". En Evolutionary Computation in Combinatorial Optimization, 84–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71615-0_8.
Texto completoHifi, Mhand, Ibrahim Moussa, Toufik Saadi y Sagvan Saleh. "An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems". En Advances in Intelligent Systems and Computing, 15–25. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18161-5_2.
Texto completoAlves, Sancrey Rodrigues, Fernanda Couto, Luerbio Faria, Sylvain Gravier, Sulamita Klein y Uéverton S. Souza. "Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and $$\ell $$ Cliques". En LATIN 2020: Theoretical Informatics, 587–99. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61792-9_46.
Texto completoActas de conferencias sobre el tema "K-clique problem"
Tsourakakis, Charalampos. "The K-clique Densest Subgraph Problem". En WWW '15: 24th International World Wide Web Conference. Republic and Canton of Geneva, Switzerland: International World Wide Web Conferences Steering Committee, 2015. http://dx.doi.org/10.1145/2736277.2741098.
Texto completoWu, Jun, Chu-Min Li, Yupeng Zhou, Minghao Yin, Xin Xu y Dangdang Niu. "HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem". En Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/668.
Texto completoKatayama, Kengo, Akihiro Hamamoto y Hiroyuki Narihisa. "Solving the maximum clique problem by k-opt local search". En the 2004 ACM symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/967900.968107.
Texto completoSoumaya, Lakehal y Aitzai Abdelhakim. "Branch and Bound for Facility Layout Problem Using Minimum Weighted Clique Problem in Complete K-partite Graph". En the 2017 International Conference. New York, New York, USA: ACM Press, 2017. http://dx.doi.org/10.1145/3175603.3175610.
Texto completoTiella, Roberto y Mariano Ceccato. "Automatic generation of opaque constants based on the k-clique problem for resilient data obfuscation". En 2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER). IEEE, 2017. http://dx.doi.org/10.1109/saner.2017.7884620.
Texto completoAlves, S. R., F. Couto, L. Faria, S. Klein y U. dos S. Souza. "O problema probe particionado split bem-coberto é polinomial". En III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3170.
Texto completoSamarawickrama, R. G. L. M., D. N. Ranasinghe y T. Sritharan. "Vemaque: Approximately verifiable remote computation of k-clique and maximum clique problems". En 2016 Sixteenth International Conference on Advances in ICT for Emerging Regions (ICTer). IEEE, 2016. http://dx.doi.org/10.1109/icter.2016.7829909.
Texto completoMonteiro, Bruno y Vinicius Dos Santos. "Equitable Partition of Graphs into Independent Sets and Cliques". En IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6392.
Texto completoCoelho, E. M. M., H. Coelho, L. Faria, M. P. Ferreira y S. Klein. "O Problema do Número Clique Orientado Absoluto é NP-completo". En Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222592.
Texto completoGao, Jian, Jiejiang Chen, Minghao Yin, Rong Chen y Yiyuan Wang. "An Exact Algorithm for Maximum k-Plexes in Massive Graphs". En Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/201.
Texto completo