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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An assignment of colours to the vertices of a graph is stable if any twovertices of the same colour have identically coloured neighbourhoods. The goalof colour refinement is to find a stable colouring that uses a minimum numberof colours. This is a widely used subroutine for graph isomorphism testingalgorithms, since any automorphism needs to be colour preserving. We give an$O((m+n)\log n)$ algorithm for finding a canonical version of such a stablecolouring, on graphs with $n$ vertices and $m$ edges. We show that no fasteralgorithm is possible, under some modest assumptions about the type ofalgorithm, which captures all known colour refinement algorithms.

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement