A SAT approach to branchwidth

Lodha, N., Ordyniak, S. orcid.org/0000-0003-1935-651X and Szeider, S. (2019) A SAT approach to branchwidth. ACM Transactions on Computational Logic, 20 (3). 15. ISSN 1529-3785

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 Association for Computing Machinery. This is an author-produced version of a paper subsequently published in ACM Transactions on Computational Logic. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Published (online): 7 June 2019
  • Published: July 2019
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 02 Jul 2019 14:54
Last Modified: 20 Jan 2020 13:16
Status: Published
Publisher: ACM
Refereed: Yes
Identification Number: https://doi.org/10.1145/3326159

Share / Export

Statistics