相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。On the Complexity of Query Result Diversification
Ting Deng et al.
ACM TRANSACTIONS ON DATABASE SYSTEMS (2014)
Streaming Submodular Maximization: Massive Data Summarization on the Fly
Ashwinkumar Badanidiyuru et al.
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14) (2014)
Distributed Maximal Clique Computation
Yanyan Xu et al.
2014 IEEE INTERNATIONAL CONGRESS ON BIG DATA (BIGDATA CONGRESS) (2014)
Fast Maximal Cliques Enumeration in Sparse Graphs
Lijun Chang et al.
ALGORITHMICA (2013)
Online maximum k-coverage
G. Ausiello et al.
DISCRETE APPLIED MATHEMATICS (2012)
Finding Maximal Cliques in Massive Networks
James Cheng et al.
ACM TRANSACTIONS ON DATABASE SYSTEMS (2011)
Large cliques in Arabidopsis gene coexpression network and motif discovery
Xiaoqi Zheng et al.
JOURNAL OF PLANT PHYSIOLOGY (2011)
Search result diversification
Marina Drosou et al.
SIGMOD RECORD (2010)
A scalable, parallel algorithm for maximal clique enumeration
Matthew C. Schmidt et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2009)
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Etsuji Tomita et al.
JOURNAL OF GLOBAL OPTIMIZATION (2007)
The worst-case time complexity for generating all maximal cliques and computational experiments
Etsuji Tomita et al.
THEORETICAL COMPUTER SCIENCE (2006)
A fast algorithm for the maximum clique problem
PRJ Östergård
DISCRETE APPLIED MATHEMATICS (2002)
分享论文
