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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we propose a high-speed greedy sequential algorithm for thevertex coloring problem (VCP), based on the Wave Function Collapse algorithm,called Wave Function Collapse Coloring (WFC-C). An iteration of this algorithmgoes through three distinct phases: vertex selection, color restriction throughwave function collapsing, and domain propagation. In effect, WFC-C propagatescolor choices or "domain" restrictions beyond immediate neighbourhoods. Thisheuristic, combined with a series of other greedy optimizations, allows for afast algorithm that prevents certain color conflicts. Through extensiveexperiments, we show that WFC-C remains competitive (and occasionally better)in terms of optimal coloring, and dramatically outperforms existing high-speedVCP, with on average speed differences ranging from 2000 times to 16000 times,on the most difficult instances of the DIMACS benchmark.

Wave Function Collapse Coloring: A New Heuristic for Fast Vertex Coloring