On the complexity landscape of connected f-factor problems

Ganian, R., Narayanaswamy, N.S., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2019) On the complexity landscape of connected f-factor problems. Algorithmica. ISSN 0178-4617

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Springer Science+Business Media, LLC, part of Springer Nature 2019. This is an author produced version of a paper subsequently published in Algorithmica. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Connected f-factors; Quasi-polynomial time algorithms; Randomized algorithms; NP-intermediate; Exponential time hypothesis
Dates:
  • Accepted: 14 January 2019
  • Published (online): 30 January 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: 20 Mar 2019 11:28
Last Modified: 20 Mar 2019 11:28
Status: Published online
Publisher: Springer
Refereed: Yes
Identification Number: https://doi.org/10.1007/s00453-019-00546-z

Download

Accepted Version


Embargoed until: 30 January 2020

Filename: journal-factor.pdf

Request a copy

Share / Export

Statistics