Cut query algorithms with star contraction

Apers, S., Efron, Y., Gawrychowski, P. et al. (3 more authors) (2022) Cut query algorithms with star contraction. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 31 Oct - 03 Nov 2022, Denver, CO, USA. Institute of Electrical and Electronics Engineers (IEEE) , pp. 507-518. ISBN 9781665455206

Abstract

Metadata

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

© 2022 IEEE.

Keywords: F.1.1 Models of Computation; F.1.3 Complexity Measures and Classes; F.2 Analysis of Algorithms and Problem Complexity
Dates:
  • Published: 28 December 2022
  • Published (online): 28 December 2022
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: 28 Jun 2023 13:29
Last Modified: 28 Jun 2023 13:29
Status: Published
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Refereed: Yes
Identification Number: 10.1109/focs54457.2022.00055
Related URLs:
Open Archives Initiative ID (OAI ID):

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Export

Statistics