George B. Mertzios |  Sotiris Nikoletseas... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 131～143 - 共13页

摘要： algorithm for δ-Temporal Clique is unlikely to have very |  threshold on the size of any maximum δ-clique (namely a |  clique with edges appearing at most δ apart within [0 | , we prove that the size of a maximum δ-clique is |  temporal graph contains Θ(n~2) overlapping δ-windows

关键词： Simple random temporal graph |  δ-temporal clique |  Probabilistic method

Bithika Pal -  《Advances in Databases and Information Systems》 -  European Conference on Advances in Databases and Information Systems - 2024, - 79～92 - 共14页

摘要： such substructure as (Δ, γ)-clique, which is a tuple |  (Δ, γ)-clique property, and recursively, adds |  are often modeled as Temporal Networks. In this |  substructures present in a given temporal network. We call |  edges in every Δ duration of the time interval. We

关键词： Temporal network |  (Δ |  γ)-Clique |  Enumeration algorithm |  Δ-Degeneracy |  Maximal clique

Banerjee Suman |  Pal Bithika -  《Social network analysis and mining》 - 2024,14(1) - 共5页

摘要： , gamma )$$end{document}-clique of a temporal network is | Abstract A Temporal Network is often used to |  notion of (Δ,γ)documentclass[12pt]{minimal} usepackage |  been introduced in one of our previous studies. A (Δ |  maximal (Δ,γ)documentclass[12pt]{minimal} usepackage

关键词： Temporal network |  Enumeration algorithm |  (Δ,γ)documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage

Suman Banerjee |  Bithika Pal -  《Database and expert systems applications : Part II》 -  International Conference on Database and Expert Systems Applications - 2021, - 346～357 - 共12页

摘要： temporal network G(V, E, T), a (Δ, γ)-Clique is a vertex |  enumerating one such pattern: maximal (Δ, γ)-Clique. Given a |  for constructing (Δ, γ)-Clique(s) with maximum | A Temporal Network is a graph whose topology |  least γ links in each Δ duration in [t_a, t_b]. The

关键词： Temporal network |  (Δ,γ)-Clique |  Enumeration algorithm

NSTL主题词： Maximal |  Network

Suman Banerjee |  Bithika Pal -  《Web Information Systems Engineering - WISE 2021: 22nd International Conference, on Web Information Systems Engineering, WISE 2021, Melbourne, VIC, Australia, October 26–29, 2021, Proceedings, Patr I》 -  International Conference on Web Information Systems Engineering - 2021, - 485～493 - 共9页

摘要：] {is contained in} T) is said to be a (Δ, γ)-clique | )), and its corresponding (Δ, γ)-clique set are known | Given a temporal network G(V, E, T), (X, [t_a |  must exist at least γ links in each Δ duration in |  [t_a, t_b]. In this paper, we study the maximal (Δ, γ

关键词： Temporal network |  (Δ, γ)-clique |  Enumeration algorithm

NSTL主题词： Maximal |  Network

Matthias Bentert |  Anne-Sophie Himmel... -  《2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining: ASONAM 2018, Barcelona, Spain, 28-31 August 2018, pages 1-649, [v.1]》 -  IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining - 2018, - 41～46 - 共6页

摘要： popular clique relaxations. We define a Δ- k-plex as a |  disappear. They can be modeled as temporal graphs where |  basic primitives to model a community is a clique | . Addressing the problem of finding communities in temporal |  networks, Viard et al. [TCS 2016] introduced Δ-cliques as

关键词： Social network services |  Electronic mail |  Image edge detection |  Biological system modeling |  Adaptation models |  Analytical models |  Wireless networks

NSTL主题词： Maximal

Anne-Sophie Himmel |  Hendrik Molter... -  《2016 IEEE/ACM international conference on advances in social networks analysis and mining: ASONAM 2016, San Francisco, California, USA, 18-21 August 2016, pages 1-718, [v.1]》 -  IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining - 2016, - 337～344 - 共8页

摘要： given time period Δ, a Δ-clique in a temporal graph is |  modeling framework to capture this are temporal graphs | . We focus on enumerating Δ-cliques, an extension of |  the concept of cliques to temporal graphs: for a |  every Δ time steps within the time interval. Viard

关键词： Algorithm design and analysis |  Standards |  Heuristic algorithms |  Social network services |  Adaptation models |  Upper bound |  Complex networks

Karl Bringmann |  Nick Fischer... -  《2024 Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2024, Alexandria, Virginia, USA, 7-10 January 2024, volume 1 of 7》 -  Annual ACM-SIAM Symposium on Discrete Algorithms - 2024, - 208～242 - 共35页

摘要： constant δ > 0, unless the Negative-κ-Clique Hypothesis |  practical applications, especially for temporal data, and |  distance with update and query time O(n~(1.5-δ)) for any | The Dynamic Time Warping (DTW) distance is a |  popular similarity measure for polygonal curves (i.e