Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks-Reference-Cited by-同舟云学术

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks

Published:2023-02-27 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining
language:
Short-container-title:

Author:

Kawase Yasushi¹^ORCID,Miyauchi Atsushi¹^ORCID,Sumita Hanna²^ORCID

Affiliation:

1. The University of Tokyo, Bunkyo-ku, Japan

2. Tokyo Institute of Technology, Meguro-ku, Japan

Funder

Japan Society for the Promotion of Science

Japan Science and Technology Agency

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3539597.3570444

Reference43 articles.

1. A. Angel , N. Sarkas , N. Koudas , and D. Srivastava . 2012. Dense subgraph maintenance under streaming edge weight updates for real-time story identification . In Proceedings of VLDB. 574--585 . A. Angel, N. Sarkas, N. Koudas, and D. Srivastava. 2012. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. In Proceedings of VLDB. 574--585.

2. T. Bacsar and G. J. Olsder . 1999 . Dynamic Noncooperative Game Theory. Classics in Applied Mathematics , Vol. 23 . SIAM. T. Bacsar and G. J. Olsder. 1999. Dynamic Noncooperative Game Theory. Classics in Applied Mathematics, Vol. 23. SIAM.

3. O. D. Balalau , F. Bonchi , T-H. H. Chan , F. Gullo , and M. Sozio . 2015. Finding subgraphs with maximum total density and limited overlap . In Proceedings of WSDM. 379--388 . O. D. Balalau, F. Bonchi, T-H. H. Chan, F. Gullo, and M. Sozio. 2015. Finding subgraphs with maximum total density and limited overlap. In Proceedings of WSDM. 379--388.

4. Identifying Influential Spreaders in Complex Multilayer Networks: A Centrality Perspective

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation;Algorithmica;2023-10-10