Статті в журналах з теми "Densest k-subgraph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-46 статей у журналах для дослідження на тему "Densest k-subgraph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаBourgeois, Nicolas, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, and Vangelis Th Paschos. "Exact and superpolynomial approximation algorithms for the densest k-subgraph problem." European Journal of Operational Research 262, no. 3 (November 2017): 894–903. http://dx.doi.org/10.1016/j.ejor.2017.04.034.
Повний текст джерелаZhang, Peng, and Zhendong Liu. "Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph." Theoretical Computer Science 849 (January 2021): 173–83. http://dx.doi.org/10.1016/j.tcs.2020.10.018.
Повний текст джерелаLiazi, Maria, Ioannis Milis, and Vassilis Zissimopoulos. "A constant approximation algorithm for the densest k-subgraph problem on chordal graphs." Information Processing Letters 108, no. 1 (September 2008): 29–32. http://dx.doi.org/10.1016/j.ipl.2008.03.016.
Повний текст джерелаAnwar, Muhammad, Aboul Ella Hassanien, Václav Snás̃el, and Sameh H. Basha. "Subgraph Query Matching in Multi-Graphs Based on Node Embedding." Mathematics 10, no. 24 (December 19, 2022): 4830. http://dx.doi.org/10.3390/math10244830.
Повний текст джерелаManurangsi, Pasin. "Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis." Algorithms 11, no. 1 (January 17, 2018): 10. http://dx.doi.org/10.3390/a11010010.
Повний текст джерелаBacker, Jonathan, and J. Mark Keil. "Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs." Information Processing Letters 110, no. 16 (July 2010): 635–38. http://dx.doi.org/10.1016/j.ipl.2010.05.011.
Повний текст джерелаHuo, Lian-Zhi, and Ping Tang. "A graph-based active learning method for classification of remote sensing images." International Journal of Wavelets, Multiresolution and Information Processing 16, no. 04 (July 2018): 1850023. http://dx.doi.org/10.1142/s0219691318500236.
Повний текст джерелаMatakos, Antonis, and Aristides Gionis. "Strengthening ties towards a highly-connected world." Data Mining and Knowledge Discovery 36, no. 1 (January 2022): 448–76. http://dx.doi.org/10.1007/s10618-021-00812-1.
Повний текст джерелаBonchi, Francesco, David García-Soriano, Atsushi Miyauchi, and Charalampos E. Tsourakakis. "Finding densest k-connected subgraphs." Discrete Applied Mathematics 305 (December 2021): 34–47. http://dx.doi.org/10.1016/j.dam.2021.08.032.
Повний текст джерелаGalbrun, Esther, Aristides Gionis, and Nikolaj Tatti. "Top-k overlapping densest subgraphs." Data Mining and Knowledge Discovery 30, no. 5 (May 26, 2016): 1134–65. http://dx.doi.org/10.1007/s10618-016-0464-z.
Повний текст джерелаMathieu, Claire, and Michel de Rougemont. "Large very dense subgraphs in a stream of edges." Network Science 9, no. 4 (December 2021): 403–24. http://dx.doi.org/10.1017/nws.2021.17.
Повний текст джерелаFeige, U., D. Peleg, and G. Kortsarz. "The Dense k -Subgraph Problem." Algorithmica 29, no. 3 (March 2001): 410–21. http://dx.doi.org/10.1007/s004530010050.
Повний текст джерелаKANG, DONG YEAP. "Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs." Combinatorics, Probability and Computing 28, no. 3 (November 5, 2018): 423–64. http://dx.doi.org/10.1017/s0963548318000469.
Повний текст джерелаFOX, JACOB, and BENNY SUDAKOV. "Decompositions into Subgraphs of Small Diameter." Combinatorics, Probability and Computing 19, no. 5-6 (June 9, 2010): 753–74. http://dx.doi.org/10.1017/s0963548310000040.
Повний текст джерела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.
Повний текст джерелаBorgwardt, S., and F. Schmiedl. "Threshold-based preprocessing for approximating the weighted dense k-subgraph problem." European Journal of Operational Research 234, no. 3 (May 2014): 631–40. http://dx.doi.org/10.1016/j.ejor.2013.09.027.
Повний текст джерелаBöhme, Thomas, and Alexandr Kostochka. "Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density." Discrete Mathematics 309, no. 4 (March 2009): 997–1000. http://dx.doi.org/10.1016/j.disc.2008.01.010.
Повний текст джерела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.
Повний текст джерелаKhot, Subhash. "Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique." SIAM Journal on Computing 36, no. 4 (January 2006): 1025–71. http://dx.doi.org/10.1137/s0097539705447037.
Повний текст джерелаBarman, Debaditya, Subhayan Bhattacharya, Ritam Sarkar, and Nirmalya Chowdhury. "$k$ -Context Technique: A Method for Identifying Dense Subgraphs in a Heterogeneous Information Network." IEEE Transactions on Computational Social Systems 6, no. 6 (December 2019): 1190–205. http://dx.doi.org/10.1109/tcss.2019.2942323.
Повний текст джерелаGallagher, Suzanne R., and Debra S. Goldberg. "Characterization of known protein complexes using k-connectivity and other topological measures." F1000Research 2 (August 13, 2013): 172. http://dx.doi.org/10.12688/f1000research.2-172.v1.
Повний текст джерелаHébert-Dufresne, Laurent, Guillaume St-Onge, John Meluso, James Bagrow, and Antoine Allard. "Hierarchical team structure and multidimensional localization (or siloing) on networks." Journal of Physics: Complexity 4, no. 3 (July 25, 2023): 035002. http://dx.doi.org/10.1088/2632-072x/ace602.
Повний текст джерелаDong, Zheng, Xin Huang, Guorui Yuan, Hengshu Zhu, and Hui Xiong. "Butterfly-core community search over labeled graphs." Proceedings of the VLDB Endowment 14, no. 11 (July 2021): 2006–18. http://dx.doi.org/10.14778/3476249.3476258.
Повний текст джерелаSun, Zitan, Xin Huang, Qing Liu, and Jianliang Xu. "Efficient Star-based Truss Maintenance on Dynamic Graphs." Proceedings of the ACM on Management of Data 1, no. 2 (June 13, 2023): 1–26. http://dx.doi.org/10.1145/3589278.
Повний текст джерелаHanaka, Tesshu. "Computing densest k-subgraph with structural parameters." Journal of Combinatorial Optimization 45, no. 1 (December 23, 2022). http://dx.doi.org/10.1007/s10878-022-00927-1.
Повний текст джерелаDondi, Riccardo, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, and Italo Zoppis. "Top-k overlapping densest subgraphs: approximation algorithms and computational complexity." Journal of Combinatorial Optimization, November 4, 2020. http://dx.doi.org/10.1007/s10878-020-00664-3.
Повний текст джерелаChang, Shih-Chia, Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Shih-Shun Kao, and Ralf Klasing. "On the Hardness and Approximation of the Densest $K$-Subgraph Problem in Parameterized Metric Graphs." SSRN Electronic Journal, 2022. http://dx.doi.org/10.2139/ssrn.4196893.
Повний текст джерелаJoret, Gwenaël, and Adrian Vetta. "Reducing the rank of a matroid." Discrete Mathematics & Theoretical Computer Science Vol. 17 no.2, Discrete Algorithms (September 16, 2015). http://dx.doi.org/10.46298/dmtcs.2135.
Повний текст джерелаKoana, Tomohiro, Christian Komusiewicz, and Frank Sommer. "Computing Dense and Sparse Subgraphs of Weakly Closed Graphs." Algorithmica, January 20, 2023. http://dx.doi.org/10.1007/s00453-022-01090-z.
Повний текст джерелаTatti, Nikolaj. "Fast computation of distance-generalized cores using sampling." Knowledge and Information Systems, January 25, 2023. http://dx.doi.org/10.1007/s10115-023-01830-9.
Повний текст джерелаDondi, Riccardo, and Danny Hermelin. "Computing the k densest subgraphs of a graph." Information Processing Letters, September 2022, 106316. http://dx.doi.org/10.1016/j.ipl.2022.106316.
Повний текст джерелаSiebertz, Sebastian. "Reconfiguration on Nowhere Dense Graph Classes." Electronic Journal of Combinatorics 25, no. 3 (August 10, 2018). http://dx.doi.org/10.37236/7458.
Повний текст джерелаDondi, Riccardo, Mohammad Mehdi Hosseinzadeh, and Pietro H. Guzzi. "A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks." Applied Network Science 6, no. 1 (June 5, 2021). http://dx.doi.org/10.1007/s41109-021-00381-8.
Повний текст джерелаLv, Zequn, Mei Lu, and Chunqiu Fang. "Density of Balanced 3-Partite Graphs without 3-Cycles or 4-Cycles." Electronic Journal of Combinatorics 29, no. 4 (December 16, 2022). http://dx.doi.org/10.37236/10958.
Повний текст джерелаLuo, Cong, Jie Ma, and Tianchi Yang. "On the maximum number of edges in -critical graphs." Combinatorics, Probability and Computing, July 24, 2023, 1–12. http://dx.doi.org/10.1017/s0963548323000238.
Повний текст джерелаHabib, Wafaa M. A., Hoda M. O. Mokhtar, and Mohamed E. El-Sharkawi. "Discovering top-weighted k-truss communities in large graphs." Journal of Big Data 9, no. 1 (April 3, 2022). http://dx.doi.org/10.1186/s40537-022-00588-1.
Повний текст джерела