Добірка наукової літератури з теми "Densest k-subgraph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Densest k-subgraph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Densest k-subgraph"
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.
Повний текст джерелаCalude, Cristian S., Michael J. Dinneen, and Richard Hua. "Quantum solutions for densest k-subgraph problems." Journal of Membrane Computing 2, no. 1 (February 4, 2020): 26–41. http://dx.doi.org/10.1007/s41965-019-00030-1.
Повний текст джерелаNonner, Tim. "PTAS for Densest $$k$$ k -Subgraph in Interval Graphs." Algorithmica 74, no. 1 (November 13, 2014): 528–39. http://dx.doi.org/10.1007/s00453-014-9956-7.
Повний текст джерела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.
Повний текст джерелаRozenshtein, Polina, Francesco Bonchi, Aristides Gionis, Mauro Sozio, and Nikolaj Tatti. "Finding events in temporal networks: segmentation meets densest subgraph discovery." Knowledge and Information Systems 62, no. 4 (October 3, 2019): 1611–39. http://dx.doi.org/10.1007/s10115-019-01403-9.
Повний текст джерелаRoupin, Frederic, and Alain Billionnet. "A deterministic approximation algorithm for the Densest k-Subgraph Problem." International Journal of Operational Research 3, no. 3 (2008): 301. http://dx.doi.org/10.1504/ijor.2008.017534.
Повний текст джерелаSotirov, Renata. "On solving the densest k-subgraph problem on large graphs." Optimization Methods and Software 35, no. 6 (March 25, 2019): 1160–78. http://dx.doi.org/10.1080/10556788.2019.1595620.
Повний текст джерелаGuo, Chuan-Hao, Yuan Guo, and Bei-Bei Liu. "Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem." Entropy 21, no. 2 (January 24, 2019): 108. http://dx.doi.org/10.3390/e21020108.
Повний текст джерелаXu, Yichen, Chenhao Ma, Yixiang Fang, and Zhifeng Bao. "Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery." Proceedings of the ACM on Management of Data 1, no. 2 (June 13, 2023): 1–27. http://dx.doi.org/10.1145/3589314.
Повний текст джерелаKonar, Aritra, and 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, no. 4 (June 28, 2022): 4075–82. http://dx.doi.org/10.1609/aaai.v36i4.20325.
Повний текст джерелаДисертації з теми "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.
Повний текст джерелаSariyuce, Ahmet Erdem. "Fast Algorithms for Large-Scale Network Analytics." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429825578.
Повний текст джерелаKhanna, Yash. "Robust Algorithms for recovering planted structures in Semi-random instances." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5096.
Повний текст джерелаЧастини книг з теми "Densest k-subgraph"
Chen, Danny Z., Rudolf Fleischer, and Jian Li. "Densest k-Subgraph Approximation on Intersection Graphs." In Approximation and Online Algorithms, 83–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18318-8_8.
Повний текст джерелаBourgeois, Nicolas, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, and Vangelis Th Paschos. "Exact and Approximation Algorithms for Densest k-Subgraph." In WALCOM: Algorithms and Computation, 114–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36065-7_12.
Повний текст джерелаNonner, Tim. "PTAS for Densest k-Subgraph in Interval Graphs." In 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.
Повний текст джерелаGonzales, Sean, and Theresa Migler. "The Densest k Subgraph Problem in b-Outerplanar Graphs." In 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.
Повний текст джерелаZhang, Peng, and Zhendong Liu. "Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph." In 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.
Повний текст джерелаChen, Wenbin, Lingxi Peng, Jianxiong Wang, Fufang Li, and Maobin Tang. "Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset." In Combinatorial Optimization and Applications, 566–73. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26626-8_41.
Повний текст джерелаChen, Xujin, Xiaodong Hu, and Changjun Wang. "Finding Connected Dense $$k$$ -Subgraphs." In Lecture Notes in Computer Science, 248–59. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17142-5_22.
Повний текст джерелаNikolentzos, Giannis, Polykarpos Meladianos, Yannis Stavrakas, and Michalis Vazirgiannis. "K-Clique-Graphs for Dense Subgraph Discovery." In 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.
Повний текст джерелаDondi, Riccardo, Pietro Hiram Guzzi, and Mohammad Mehdi Hosseinzadeh. "Top-k Connected Overlapping Densest Subgraphs in Dual Networks." In Complex Networks & Their Applications IX, 585–96. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65351-4_47.
Повний текст джерелаValari, Elena, Maria Kontaki, and Apostolos N. Papadopoulos. "Discovery of Top-k Dense Subgraphs in Dynamic Graph Collections." In 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.
Повний текст джерелаТези доповідей конференцій з теми "Densest k-subgraph"
Tsourakakis, Charalampos. "The K-clique Densest Subgraph Problem." In 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.
Повний текст джерелаBraverman, Mark, Young Kun Ko, Aviad Rubinstein, and Omri Weinstein. "ETH Hardness for Densest-k-Subgraph with Perfect Completeness." In 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.
Повний текст джерелаJones, Chris, Aaron Potechin, Goutham Rajendran, and Jeff Xu. "Sum-of-Squares Lower Bounds for Densest k-Subgraph." In STOC '23: 55th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3564246.3585221.
Повний текст джерелаManurangsi, Pasin. "Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph." In STOC '17: Symposium on Theory of Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3055399.3055412.
Повний текст джерелаBhaskara, Aditya, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, and Yuan Zhou. "Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph." In 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.
Повний текст джерелаTasnádi, Zoltán, and Noémi Gaskó. "An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*." In 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2022. http://dx.doi.org/10.1109/synasc57785.2022.00039.
Повний текст джерелаHuang, Nan. "A QUBO Formulation For the K-densest Common Subgraph Isomorphism Problem Via Quantum Annealing." In 2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE). IEEE, 2020. http://dx.doi.org/10.1109/csde50874.2020.9411586.
Повний текст джерелаChang, Shih-Chia, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, and Ralf Klasing. "The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs." In 2020 International Computer Symposium (ICS). IEEE, 2020. http://dx.doi.org/10.1109/ics51289.2020.00034.
Повний текст джерелаGuo, Chuanhao, and Liping Tang. "A New Relaxation Method for Binary Quadratic Programming: An Application to Densest k-subgraph." In 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.
Повний текст джерелаNasir, Muhammad Anis Uddin, Aristides Gionis, Gianmarco De Francisci Morales, and Sarunas Girdzijauskas. "Fully Dynamic Algorithm for Top- k Densest Subgraphs." In CIKM '17: ACM Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3132847.3132966.
Повний текст джерела