The dynamic descriptive complexity of k-clique

被引：2
|
作者：
Zeume, Thomas [1 ]
机构：
[1] Tech Univ Dortmund, Dortmund, Germany
来源：
INFORMATION AND COMPUTATION | 2017年 / 256卷
关键词：
Dynamic complexity; k-Clique; Ramsey numbers; BOUNDS;
D O I：
10.1016/j.ic.2017.04.005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this work the dynamic descriptive complexity of the k-clique query is studied. It is shown that when edges may only be inserted then k-clique can be maintained by a quantifier-free update program of arity k - 1, but it cannot be maintained by a quantifierfree update program of arity k - 2(even in the presence of unary auxiliary functions). This establishes an arity hierarchy for graph queries for quantifier-free update programs under insertions. The proof of the lower bound uses upper and lower bounds for Ramsey numbers. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码：9 / 22
页数：14
相关论文
共 50 条
  • [41] The Critical Point of k-Clique Percolation in the Erdős–Rényi Graph
    Gergely Palla
    Imre Derényi
    Tamás Vicsek
    Journal of Statistical Physics, 2007, 128 : 219 - 227
  • [42] Clustering of SSH Brute-Force Attack Logs Using k-Clique Percolation
    Studiawan, Hudan
    Pratomo, Baskoro Adi
    Anggoro, Radityo
    PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON INFORMATION & COMMUNICATION TECHNOLOGY AND SYSTEMS (ICTS), 2016, : 39 - 42
  • [43] Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
    Esmaeel Moradi
    Balabhaskar Balasundaram
    Optimization Letters, 2018, 12 : 1947 - 1957
  • [44] Identifying and evaluating the internet opinion leader community based on k-clique clustering
    Weizhe Zhang
    Hui He
    Boran Cao
    Neural Computing and Applications, 2014, 25 : 595 - 602
  • [45] Heterogeneous quantum computing for satellite constellation optimization: solving the weighted k-clique problem
    Bass, Gideon
    Tomlin, Casey
    Kumar, Vaibhaw
    Rihaczek, Pete
    Dulny, Joseph, III
    QUANTUM SCIENCE AND TECHNOLOGY, 2018, 3 (02):
  • [46] Automatic Generation of Opaque Constants Based on the K-Clique Problem for Resilient Data Obfuscation
    Tiella, Roberto
    Ceccato, Mariano
    2017 IEEE 24TH INTERNATIONAL CONFERENCE ON SOFTWARE ANALYSIS, EVOLUTION, AND REENGINEERING (SANER), 2017, : 182 - 192
  • [47] Mining Periodic k-Clique from Real-World Sparse Temporal Networks
    Ren, Zebin
    Qin, Hongchao
    Li, Rong-Hua
    Dai, Yongheng
    Wang, Guoren
    Li, Yanhui
    WEB AND BIG DATA, PT I, APWEB-WAIM 2022, 2023, 13421 : 461 - 476
  • [48] An Overlapping Community Discovery Algorithm Based on Label Propagation Constructing a K-Clique Network
    Xu, Xinqi
    Zheng, Xiaoyan
    2022 IEEE THE 5TH INTERNATIONAL CONFERENCE ON BIG DATA AND ARTIFICIAL INTELLIGENCE (BDAI 2022), 2022, : 232 - 236
  • [49] KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs
    Sun, Bintao
    Danisch, Maximilien
    Chan, T-H Hubert
    Sozio, Mauro
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 13 (10): : 1628 - 1640
  • [50] Efficient k-Clique Counting on Large Graphs: The Power of Color-Based Sampling Approaches
    Ye, Xiaowei
    Li, Rong-Hua
    Dai, Qiangqiang
    Chen, Hongzhi
    Wang, Guoren
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (04) : 1518 - 1536
12345