Beyond Max-Cut: λ-extendible properties parameterized above Poljak-Turzík bound

Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchy

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We define strong ?-extendibility as a variant of the notion of ?-extendible properties of graphs (poljak and turzík, discrete mathematics, 1986). We show that the parameterized apt(p) problem — given a connected graph g on n vertices and m edges and an integer parameter k, does there exist a spanning subgraph h of g such that h?p and h has at least ?m+1-?2(n-1)+k edges — is fixed-parameter tractable (fpt) for all 0
Original languageEnglish
Pages (from-to)1384-1403
JournalJournal of Computer and System Sciences
Volume80
Issue number7
DOIs
Publication statusPublished - 2014
Externally publishedYes

Cite this