On Testability of First-Order Properties in Bounded-Degree Graphs

Adler, I orcid.org/0000-0002-9667-9841, Köhler, N and Peng, P (2021) On Testability of First-Order Properties in Bounded-Degree Graphs. In: SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '21: ACM-SIAM Symposium on Discrete Algorithms, 10-13 Jan 2021, Online. ACM , pp. 1578-1597. ISBN 9781611976465

Abstract

Metadata

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

© 2021 by SIAM. This is an author produced version of a conference paper published in SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. Uploaded in accordance with the publisher's self-archiving policy.

Dates:
  • Published: 7 January 2021
  • Accepted: 30 September 2020
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 07 Oct 2020 15:45
Last Modified: 12 Dec 2024 15:38
Status: Published
Publisher: ACM
Identification Number: 10.1137/1.9781611976465.96
Open Archives Initiative ID (OAI ID):

Export

Statistics