• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4641779)   Today's Articles (3639)   Subscriber (50472)
For: Himmel AS, Molter H, Niedermeier R, Sorge M. Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc Netw Anal Min 2017. [DOI: 10.1007/s13278-017-0455-0] [Citation(s) in RCA: 15] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/19/2022]
Number Cited by Other Article(s)
1
Hosseinzadeh MM, Cannataro M, Guzzi PH, Dondi R. Temporal networks in biology and medicine: a survey on models, algorithms, and tools. NETWORK MODELING AND ANALYSIS IN HEALTH INFORMATICS AND BIOINFORMATICS 2022;12:10. [PMID: 36618274 PMCID: PMC9803903 DOI: 10.1007/s13721-022-00406-x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 11/03/2022] [Revised: 12/16/2022] [Accepted: 12/17/2022] [Indexed: 01/01/2023]
2
Rashid A, Kamran M, Halim Z. A top down approach to enumerate α-maximal cliques in uncertain graphs. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2019. [DOI: 10.3233/jifs-18263] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
3
Enumerating maximal cliques in link streams with durations. INFORM PROCESS LETT 2018. [DOI: 10.1016/j.ipl.2018.01.006] [Citation(s) in RCA: 15] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022]
PrevPage 1 of 1 1Next
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA