Fetching the paper…
Reading the bibliography…
We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the subgraphs induced by $S$ in each of the given graphs.
Finding a maximum density subgraph
Andrew V Goldberg · 1984
Earlier work this paper cites.
Clique is hard to approximate within n 1 − ϵ n^{1-\epsilon}
Johan Håstad · 1999
Earlier work this paper cites.
Greedy approximation algorithms for finding dense components in a graph
Moses Charikar · 2000
Earlier work this paper cites.
On the hardness of approximating spanners
Guy Kortsarz · 2001
Earlier work this paper cites.
A new multilayered PCP and the hardness of hypergraph vertex cover
Irit Dinur, Venkatesan Guruswami, Subhash Khot, and Oded Regev · 2005
Earlier work this paper cites.
Mining coherent dense subgraphs across massive biological networks for functional discovery
Haiyan Hu, Xifeng Yan, Yu Huang, Jiawei Han, and Xianghong Jasmine Zhou · 2005
Earlier work this paper cites.
Linear degree extractors and the inapproximability of max clique and chromatic number
David Zuckerman · 2006
Earlier work this paper cites.
Public-key cryptography from different assumptions
Benny Applebaum, Boaz Barak, and Avi Wigderson · 2010
Cited alongside, same era.
Computational complexity and information asymmetry in financial products
Sanjeev Arora, Boaz Barak, Markus Brunnermeier, and Rong Ge · 2010
Cited alongside, same era.
Lovász ϑ \vartheta function, SVMs and finding dense subgraphs
Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, and Devdatt Dubhashi · 2013
Cited alongside, same era.
k k -core percolation on multiplex networks
N Azimi-Tafreshi, J Gómez-Gardenes, and SN Dorogovtsev · 2014
Cited alongside, same era.
Label optimal regret bounds for online local learning
Pranjal Awasthi, Moses Charikar, Kevin A. Lai, and Andrej Risteski · 2015
Cited alongside, same era.
Finding dense subgraphs in relational graphs
Vinay Jethava and Niko Beerenwinkel · 2015
Cited alongside, same era.
Finding the densest common subgraph with linear programming
Alexander Reinthal Anton Törnqvist Arvid Andersson and Erik Norlander Philip Stalhammar Sebastian Norlin · 2016
Later among the works it cites.
On the size and the approximability of minimum temporally connected subgraphs
Kyriakos Axiotis and Dimitris Fotakis · 2016
Later among the works it cites.
On approximating target set selection
Moses Charikar, Yonatan Naamad, and Anthony Wirth · 2016
Later among the works it cites.
Best friends forever (BFF): Finding lasting dense subgraphs
Konstantinos Semertzidis, Evaggelia Pitoura, Evimaria Terzi, and Panayiotis Tsaparas · 2016
Later among the works it cites.
On D k k S hardness for MinRep-hard problems
Moses Charikar, Yonatan Naamad, and Anthony Wirth · 2017
Later among the works it cites.
Core decomposition and densest subgraph in multilayer networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Edoardo Galimberti, Francesco Bonchi, and Francesco Gullo · 2017
Later among the works it cites.