On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing

Adler, I., Koehler, N. orcid.org/0000-0002-1023-6530 and Peng, P. (2024) On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM Journal on Computing (SICOMP), 53 (4). 825- 883. ISSN 0097-5397

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2024 Society for Industrial and Applied Mathematics. This is an author produced version of an article published in SIAM Journal on Computing. Uploaded in accordance with the publisher's self-archiving policy.

Keywords: graph property testing, first-order logic, proximity-oblivious testing, locality, lower bound
Dates:
  • Published: August 2024
  • Published (online): 4 July 2024
  • Accepted: 9 April 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 10 May 2024 14:54
Last Modified: 26 Jul 2024 13:15
Status: Published
Publisher: Society for Industrial and Applied Mathematics
Identification Number: 10.1137/23M1556253
Open Archives Initiative ID (OAI ID):

Export

Statistics