Related references
Note: Only part of the references are listed.Top-k overlapping densest subgraphs: approximation algorithms and computational complexity
Riccardo Dondi et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2021)
The Densest Subgraph Problem with a Convex/Concave Size Function
Yasushi Kawase et al.
ALGORITHMICA (2018)
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
Yuichi Asahiro et al.
ALGORITHMICA (2018)
Fully Dynamic Algorithm for Top-k Densest Subgraphs
Muhammad Anis Uddin Nasir et al.
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT (2017)
Top-k overlapping densest subgraphs
Esther Galbrun et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2016)
Multivariate Algorithmics for Finding Cohesive Subnetworks
Christian Komusiewicz
ALGORITHMS (2016)
Finding Subgraphs with Maximum Total Density and Limited Overlap
Oana Denisa Balalau et al.
WSDM'15: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (2015)
MotifCut: regulatory motifs finding with maximum density subgraphs
Eugene Fratkin et al.
BIOINFORMATICS (2006)
Complexity of finding dense subgraphs
Y Asahiro et al.
DISCRETE APPLIED MATHEMATICS (2002)
An exact algorithm for the maximum k-club problem in an undirected graph
JM Bourjolly et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
The dense k-subgraph problem
U Feige et al.
ALGORITHMICA (2001)
Share Paper
