Article
Computer Science, Artificial Intelligence
Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang
Summary: The existing clique model is inapplicable for signed networks, so a balanced clique model is proposed. The maximal balanced clique enumeration problem and the maximum balanced clique search problem are studied, and solutions are proposed. Extensive experiments demonstrate the efficiency, effectiveness and scalability of the algorithms.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
(2023)
Article
Management
Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao, Oleg A. Prokopyev
Summary: This paper focuses on the maximum 2-club problem and introduces two new mixed-integer programming models for finding maximum 2-clubs. The study also includes feasibility versions of the MIPs and an algorithm for verifying the existence of 2-clubs of specified sizes. The results show that the MIPs provide tighter LP relaxations for sparse graphs and can be extended to solve robust generalizations of the maximum 2-club problem.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Artificial Intelligence
Anushree Bhattacharya, Madhumangal Pal
Summary: This paper introduces new concepts involving clique covering of a fuzzy graph for optimizing business strategy parameters. It presents four algorithms for finding necessary parameters and sets of a fuzzy graph to construct a linear programming cordon. By characterizing and solving facility location problems with this approach, the paper aims to maximize total gain and contribute to sustainable economic growth worldwide.
Article
Computer Science, Information Systems
Jing Bai, Junfeng Zhou, Ming Du, Peng Zhong
Summary: This paper studies how to enumerate the top-K maximal cliques with the most number of vertices and introduces the concept of alpha-MCs with probability constraints. By proposing the Top-KMC algorithm, (k, alpha)-MCs are efficiently computed in three steps of partition, enumeration, and verification. Experimental results demonstrate that both Top-KMC and Top-KMC+ can efficiently return the k largest alpha-MCs.
Article
Management
Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin
Summary: An s-bundle is a connected graph with a vertex connectivity of at least n - s, used to represent cohesive groups with an emphasis on member connectivity; the algorithm solves this NP-hard problem with new branching rules, graph coloring-based bounding technique, and reduction rules using structural information, outperforming existing approaches on well-known benchmark graphs.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Operations Research & Management Science
Janos Barta, Roberto Montemanni
Summary: This paper explores a new approach to reduce the maximum clique problem associated with permutation Hamming graphs. By utilizing symmetry properties and additional knowledge on automorphism groups, the size of the problem is reduced and the solving method becomes more efficient.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
Qi Zhang, Rong-Hua Li, Minjia Pan, Yongheng Dai, Qun Tian, Guoren Wang
Summary: This article introduces the problem of cohesive subgraph mining on attributed graphs and introduces the concept of fairness into the clique model for the first time. The authors propose three fairness-aware maximal clique models and corresponding mining algorithms, and demonstrate the effectiveness of the algorithms through extensive experiments on real-world graphs.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
(2023)
Article
Mathematics
C. Cedillo, M. A. Pizana
Summary: The clique operator transforms a graph into its clique graph, and iterated clique graphs are defined by a recursive process. While extensively studied, clique-convergence lacks a clear characterization. Automatic graphs, with strong decidability properties, have been proven to have undecidable clique-convergence, even when restricted to certain subclasses like quasi-clique-Helly and bounded degree graphs.
JOURNAL OF GRAPH THEORY
(2021)
Article
Computer Science, Artificial Intelligence
Srinibas Swain, Deepak Puthal, Elisa Bertino
Summary: This article introduces a graph-theoretic encryption method called CryptoCliqIn and proves that the decryption complexity of this encryption is #P-complete without the appropriate key. It also provides a more secure mechanism compared to existing encryption techniques. The adaptation of CryptoCliqIn in an intelligent system under the setup of intelligent and smart building is also discussed.
IEEE INTELLIGENT SYSTEMS
(2022)
Article
Mathematics, Applied
Pablo De Caria
Summary: This paper is inspired by the characterization of chordal graphs as the intersection graphs of subtrees of a tree. It investigates the recognition of induced tree families of any graph and proves its NP-Completeness. It also discusses the limitation of generalizing the concept of clique tree for chordal graphs. Furthermore, the paper characterizes the intersection graphs of induced trees of bipartite graphs with certain restrictions.
DISCRETE APPLIED MATHEMATICS
(2022)
Article
Mathematics
Aaron Berger, Yufei Zhao
Summary: Ellis, Filmus, and Friedgut proved a conjecture and proposed new conjectures regarding triangle-intersecting families and certain cross-intersecting and Kt-intersecting families. They also established a stability result.
JOURNAL OF COMBINATORIAL THEORY SERIES B
(2023)
Article
Mathematics
Daniel Gerbner, Daniel T. Nagy, Balazs Patkos, Mate Vizer
Summary: The study focuses on the maximum number of copies of a graph H in graphs with a certain number of vertices and edges, which is asymptotically realized by quasi-cliques when the edge density is sufficiently large. The problem is also investigated with a variant where the host graph is bipartite.
JOURNAL OF GRAPH THEORY
(2021)
Article
Biochemical Research Methods
Takuji Shoda, Genichiro Tsuji, Maiko Kawamura, Takashi Kurohara, Takashi Misawa, Ruri Kikura-Hanajiri, Yosuke Demizu
Summary: This study synthesized MiPLA and analyzed its structure using liquid chromatography-mass spectrometry. The findings revealed that MiPLA was synthesized from ergometrine maleate through three steps and resulted in the formation of iso-MiPLA as a by-product. The chemical structures of MiPLA and iso-MiPLA were determined using nuclear magnetic resonance spectroscopy.
DRUG TESTING AND ANALYSIS
(2023)
Review
Computer Science, Information Systems
Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
Summary: This paper investigates the maximum clique problem for graphs with small intersection number and random intersection graphs, presenting a simple algorithm to find a maximum clique in polynomial time, especially when the number of labels is not too large. The study also proves that inferring the complete information of label choices for each vertex from the resulting random intersection graph is solvable with a unique solution using the maximum likelihood estimation method. The research contributes to the field by introducing the Single Label Clique Theorem to address the problem of forming large cliques from more than one label.
COMPUTER SCIENCE REVIEW
(2021)
Article
Mathematics
Kinkar Chandra Das, Yilun Shang
Summary: This paper investigates the lower and upper bounds on the Sombor index of graph G in terms of graph parameters (clique number, chromatic number, number of pendant vertices, etc.) and characterizes the extremal graphs.
Article
Physics, Fluids & Plasmas
Igor Belykh, Reimbay Reimbayev, Kun Zhao
Review
Pharmacology & Pharmacy
Wen Li, Han Zhang, Yehuda G. Assaraf, Kun Zhao, Xiaojun Xue, Jinbing Xie, Dong-Hua Yang, Zhe-Sheng Chen
DRUG RESISTANCE UPDATES
(2016)
Article
Microbiology
Anna M. Montmayeur, Terry Fei Fan Ng, Alexander Schmidt, Kun Zhao, Laura Magana, Jane Iber, Christina J. Castro, Qi Chen, Elizabeth Henderson, Edward Ramos, Jing Shaw, Roman L. Tatusov, Naomi Dybdahl-Sissoko, Marie Claire Endegue-Zanga, Johnson A. Adeniji, M. Steven Oberste, Cara C. Burns
JOURNAL OF CLINICAL MICROBIOLOGY
(2017)
Article
Virology
Jinxin Gao, Crystal Gigante, Ekaterine Khmaladze, Pengbo Liu, Shiyuyun Tang, Kimberly Wilkins, Kun Zhao, Whitni Davidson, Yoshinori Nakazawa, Giorgi Maghlakelidze, Marika Geleishvili, Maka Kokhreidze, Darin S. Carroll, Ginny Emerson, Yu Li
Article
Biochemistry & Molecular Biology
Kun Zhao, Xue Wang, Hing C. Wong, Robert Wohlhueter, Michael P. Kirberger, Guantao Chen, Jenny J. Yang
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS
(2012)
Article
Public, Environmental & Occupational Health
Jaume Jorba, Ousmane M. Diop, Jane Iber, Elizabeth Henderson, Kun Zhao, Roland W. Sutter, Steven G. F. Wassilak, Cara C. Burns
MMWR-MORBIDITY AND MORTALITY WEEKLY REPORT
(2018)
Article
Public, Environmental & Occupational Health
Jaume Jorba, Ousmane M. Diop, Jane Iber, Elizabeth Henderson, Kun Zhao, Arshad Quddus, Roland Sutter, John F. Vertefeuille, Jay Wenger, Steven G. F. Wassilak, Mark A. Pallansch, Cara C. Burns
MMWR-MORBIDITY AND MORTALITY WEEKLY REPORT
(2019)
Article
Mathematics, Applied
Kevin Daley, Kun Zhao, Igor Belykh
Article
Biochemical Research Methods
Jiahui Tan, Yutong Zhao, Cara C. Burns, Dechao Tian, Kun Zhao
Summary: The Global Polio Eradication Initiative has developed a new method called Major Minor Variation Clustering (MMVC) to improve the identification of polio clusters and trace sources of the virus. This method combines sequence similarity, onset dates, and incorporates major and minor variants to detect fine-scale polio clusters. Applying MMVC to a dataset from Nigeria showed improvements over traditional phylogenetic tree approaches. This method has the potential to enhance epidemiological surveillance and investigation precision in the effort to eradicate polio.
JOURNAL OF COMPUTATIONAL BIOLOGY
(2023)
Article
Biochemistry & Molecular Biology
W. Li, K. Zhao, M. Kirberger, W. Liao, Y. Yan
CELLULAR AND MOLECULAR BIOLOGY
(2015)