This article is available for purchase or by subscription. See below.
Abstract
|
The family of Weisfeiler–Leman equivalences on graphs is a widely studied
approximation of graph isomorphism with many different characterizations. We study
these and other approximations of isomorphism defined in terms of refinement
operators and Schurian polynomial approximation schemes (SPAS). The general
framework of SPAS allows us to study a number of parameters of the refinement
operators based on Weisfeiler–Leman refinement, logic with counting, lifts of
Weisfeiler–Leman as defined by Evdokimov and Ponomarenko, the invertible map
test introduced by Dawar and Holm, and variations of these, as well as to establish
relationships between them.
|
PDF Access Denied
We have not been able to recognize your IP address
35.175.191.46
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
Weisfeiler–Leman, combinatorics, invertible map, graph
isomorphism, complexity theory, coherent configuration
|
Mathematical Subject Classification 2010
Primary: 05E15, 05E30, 05E99
Secondary: 03D15
|
Milestones
Received: 3 August 2019
Revised: 14 May 2020
Accepted: 29 May 2020
Published: 15 October 2020
|
|