English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we are going to review how the maximum clique problem is solved in the real-time systems' environment. This environment is rarely considered by researches although a lot of applications are hosted there. The complexity of the maximum clique problem produces a conflict in such environment since real time systems usually want the answer after some small amount of time is elapsed. In this article we introduce an "incomplete solution" term. The "incomplete solution" approach allows fixing a point of a "ready-to-return" answer state in the real-time systems. We also review how best nowadays algorithms are performing in finding the maximum clique in the real-time environment and conclude about which on them can be successfully used.

Incomplete Solution Approach for the Maximum Clique Finding in the Real Time Systems