Skip to main content

Advertisement

Springer Nature Link
Log in

Solving diversified top-k weight clique search problem

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Zheng X Q, Liu T G, Yang Z N, et al. Large cliques in Arabidopsis gene coexpression network and motif discovery. J Plant Physiol, 2011, 168: 611–618

    Article  Google Scholar 

  2. Conrad L, Aaron M, Fergal R, et al. Detecting highly overlapping community structure by greedy clique expansion. In: Proceedings the 4th SNA-KDD Workshop on Social Network Mining and Analysis, Washington, 2010. 112–119

  3. Krause A, Guestrin C. Near-optimal observation selection using submodular functions. In: Proceedings AAAI Conference on Artificial Intelligence, Canada, 2007. 22–26

  4. Berry N M, Ko T H, Moy T, et al. Emergent clique formation in terrorist recruitment. In: Proceedings the AAAI Workshop on Agent Organizations: Theory and Practice, Menlo Park, 2004

  5. Feige U. A threshold of ln n for approximating set cover. J ACM, 1998, 45: 634–652

    Article  MathSciNet  Google Scholar 

  6. Yuan L, Qin L, Lin X M, et al. Diversified top-k clique search. VLDB J, 2016, 25: 171–196

    Article  Google Scholar 

  7. Li C M, Manyà F, Quan Z, et al. Exact MinSAT solving. In: Proceedings the 13th International Conference on Theory and Applications of Satisfiability Testing, Edinburgh, 2010. 363–368

  8. Alexey I, Morgado A, Marques-Silva J. RC2: an efficient MaxSAT solver. J Satisfiability Boolean Modeling Comput, 2019, 11: 53–64

    Article  MathSciNet  Google Scholar 

  9. Fahiem B, Matti J, Ruben M. MaxSAT Evaluation 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series B-2019-2. 2019

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant Nos. 61976050, 61403076, 61806050, 61806082) and Fundamental Research Funds for the Central Universities (Grant No. 2412019FZ050).

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Northeast Normal University, Changchun, 130117, China

    Junping Zhou, Yupeng Zhou, Mingyang Li, Lili Liang & Jianan Wang

  2. Modélisation, Information & Systèmes, Université de Picardie Jules Verne, Amiens, 80000, France

    Chumin Li

Authors
  1. Junping Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chumin Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yupeng Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Mingyang Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Lili Liang
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Jianan Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jianan Wang.

Supplementary File

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, J., Li, C., Zhou, Y. et al. Solving diversified top-k weight clique search problem. Sci. China Inf. Sci. 64, 150105 (2021). https://doi.org/10.1007/s11432-020-3069-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-020-3069-4