Literatura académica sobre el tema "Densest k-subgraph"
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 "Densest k-subgraph".
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 "Densest k-subgraph"
Sun, 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 completoCalude, Cristian S., Michael J. Dinneen y Richard Hua. "Quantum solutions for densest k-subgraph problems". Journal of Membrane Computing 2, n.º 1 (4 de febrero de 2020): 26–41. http://dx.doi.org/10.1007/s41965-019-00030-1.
Texto completoNonner, Tim. "PTAS for Densest $$k$$ k -Subgraph in Interval Graphs". Algorithmica 74, n.º 1 (13 de noviembre de 2014): 528–39. http://dx.doi.org/10.1007/s00453-014-9956-7.
Texto completoLiazi, Maria, Ioannis Milis, Fanny Pascual y Vassilis Zissimopoulos. "The densest k-subgraph problem on clique graphs". Journal of Combinatorial Optimization 14, n.º 4 (21 de marzo de 2007): 465–74. http://dx.doi.org/10.1007/s10878-007-9069-1.
Texto completoRozenshtein, Polina, Francesco Bonchi, Aristides Gionis, Mauro Sozio y Nikolaj Tatti. "Finding events in temporal networks: segmentation meets densest subgraph discovery". Knowledge and Information Systems 62, n.º 4 (3 de octubre de 2019): 1611–39. http://dx.doi.org/10.1007/s10115-019-01403-9.
Texto completoRoupin, Frederic y Alain Billionnet. "A deterministic approximation algorithm for the Densest k-Subgraph Problem". International Journal of Operational Research 3, n.º 3 (2008): 301. http://dx.doi.org/10.1504/ijor.2008.017534.
Texto completoSotirov, Renata. "On solving the densest k-subgraph problem on large graphs". Optimization Methods and Software 35, n.º 6 (25 de marzo de 2019): 1160–78. http://dx.doi.org/10.1080/10556788.2019.1595620.
Texto completoGuo, Chuan-Hao, Yuan Guo y Bei-Bei Liu. "Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem". Entropy 21, n.º 2 (24 de enero de 2019): 108. http://dx.doi.org/10.3390/e21020108.
Texto completoXu, Yichen, Chenhao Ma, Yixiang Fang y Zhifeng Bao. "Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery". Proceedings of the ACM on Management of Data 1, n.º 2 (13 de junio de 2023): 1–27. http://dx.doi.org/10.1145/3589314.
Texto completoKonar, Aritra y Nicholas D. Sidiropoulos. "The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization". Proceedings of the AAAI Conference on Artificial Intelligence 36, n.º 4 (28 de junio de 2022): 4075–82. http://dx.doi.org/10.1609/aaai.v36i4.20325.
Texto completoTesis sobre el tema "Densest k-subgraph"
Wu, Yubao. "Efficient and Effective Local Algorithms for Analyzing Massive Graphs". Case Western Reserve University School of Graduate Studies / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=case1454451336.
Texto completoSariyuce, Ahmet Erdem. "Fast Algorithms for Large-Scale Network Analytics". The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429825578.
Texto completoKhanna, Yash. "Robust Algorithms for recovering planted structures in Semi-random instances". Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5096.
Texto completoCapítulos de libros sobre el tema "Densest k-subgraph"
Chen, Danny Z., Rudolf Fleischer y Jian Li. "Densest k-Subgraph Approximation on Intersection Graphs". En Approximation and Online Algorithms, 83–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18318-8_8.
Texto completoBourgeois, Nicolas, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis y Vangelis Th Paschos. "Exact and Approximation Algorithms for Densest k-Subgraph". En WALCOM: Algorithms and Computation, 114–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36065-7_12.
Texto completoNonner, Tim. "PTAS for Densest k-Subgraph in Interval Graphs". En Lecture Notes in Computer Science, 631–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22300-6_53.
Texto completoGonzales, Sean y Theresa Migler. "The Densest k Subgraph Problem in b-Outerplanar Graphs". En Complex Networks and Their Applications VIII, 116–27. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36687-2_10.
Texto completoZhang, Peng y Zhendong Liu. "Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph". En Algorithmic Aspects in Information and Management, 161–72. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57602-8_15.
Texto completoChen, Wenbin, Lingxi Peng, Jianxiong Wang, Fufang Li y Maobin Tang. "Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset". En Combinatorial Optimization and Applications, 566–73. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26626-8_41.
Texto completoChen, Xujin, Xiaodong Hu y Changjun Wang. "Finding Connected Dense $$k$$ -Subgraphs". En Lecture Notes in Computer Science, 248–59. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17142-5_22.
Texto completoNikolentzos, Giannis, Polykarpos Meladianos, Yannis Stavrakas y Michalis Vazirgiannis. "K-Clique-Graphs for Dense Subgraph Discovery". En Machine Learning and Knowledge Discovery in Databases, 617–33. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71249-9_37.
Texto completoDondi, Riccardo, Pietro Hiram Guzzi y Mohammad Mehdi Hosseinzadeh. "Top-k Connected Overlapping Densest Subgraphs in Dual Networks". En Complex Networks & Their Applications IX, 585–96. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65351-4_47.
Texto completoValari, Elena, Maria Kontaki y Apostolos N. Papadopoulos. "Discovery of Top-k Dense Subgraphs in Dynamic Graph Collections". En Lecture Notes in Computer Science, 213–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31235-9_14.
Texto completoActas de conferencias sobre el tema "Densest k-subgraph"
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 completoBraverman, Mark, Young Kun Ko, Aviad Rubinstein y Omri Weinstein. "ETH Hardness for Densest-k-Subgraph with Perfect Completeness". En Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.86.
Texto completoJones, Chris, Aaron Potechin, Goutham Rajendran y Jeff Xu. "Sum-of-Squares Lower Bounds for Densest k-Subgraph". En STOC '23: 55th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3564246.3585221.
Texto completoManurangsi, Pasin. "Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph". En STOC '17: Symposium on Theory of Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3055399.3055412.
Texto completoBhaskara, Aditya, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan y Yuan Zhou. "Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph". En Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973099.34.
Texto completoTasnádi, Zoltán y Noémi Gaskó. "An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*". En 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2022. http://dx.doi.org/10.1109/synasc57785.2022.00039.
Texto completoHuang, Nan. "A QUBO Formulation For the K-densest Common Subgraph Isomorphism Problem Via Quantum Annealing". En 2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE). IEEE, 2020. http://dx.doi.org/10.1109/csde50874.2020.9411586.
Texto completoChang, Shih-Chia, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao y Ralf Klasing. "The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs". En 2020 International Computer Symposium (ICS). IEEE, 2020. http://dx.doi.org/10.1109/ics51289.2020.00034.
Texto completoGuo, Chuanhao y Liping Tang. "A New Relaxation Method for Binary Quadratic Programming: An Application to Densest k-subgraph". En 2018 International Conference on Mathematics, Modelling, Simulation and Algorithms (MMSA 2018). Paris, France: Atlantis Press, 2018. http://dx.doi.org/10.2991/mmsa-18.2018.70.
Texto completoNasir, Muhammad Anis Uddin, Aristides Gionis, Gianmarco De Francisci Morales y Sarunas Girdzijauskas. "Fully Dynamic Algorithm for Top- k Densest Subgraphs". En CIKM '17: ACM Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3132847.3132966.
Texto completo