On the Complexity Landscape of Connected f-Factor Problems

Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
January 2019
PDF bib Project

Abstract

Full Citation:

Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan. On the Complexity Landscape of Connected f-Factor Problems. Algorithmica, volume 81, number 6, pages 2606-2632, 2019.

Type
Journal Article
Nfpc
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.