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

Matthias Mnich; Geevarghese Philip; Saket Saurabh; Ondrej Suchy

doi:10.1016/j.jcss.2014.04.011

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

Matthias Mnich, Geevarghese Philip^*, Saket Saurabh, Ondrej Suchy

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	1384-1403
Journal	Journal of Computer and System Sciences
Volume	80
Issue number	7
DOIs	https://doi.org/10.1016/j.jcss.2014.04.011
Publication status	Published - 2014
Externally published	Yes

Access to Document

10.1016/j.jcss.2014.04.011Licence: Free access - publisher

Cite this

@article{1154aa9d58c04f24bbe7616c36d5edbe,

title = "Beyond Max-Cut: λ-extendible properties parameterized above Poljak-Turz{\'i}k bound",

abstract = "We define strong ?-extendibility as a variant of the notion of ?-extendible properties of graphs (poljak and turz{\'i}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",

author = "Matthias Mnich and Geevarghese Philip and Saket Saurabh and Ondrej Suchy",

year = "2014",

doi = "10.1016/j.jcss.2014.04.011",

language = "English",

volume = "80",

pages = "1384--1403",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "7",

}

TY - JOUR

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

AU - Mnich, Matthias

AU - Philip, Geevarghese

AU - Saurabh, Saket

AU - Suchy, Ondrej

PY - 2014

Y1 - 2014

N2 - 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

AB - 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

U2 - 10.1016/j.jcss.2014.04.011

DO - 10.1016/j.jcss.2014.04.011

M3 - Article

SN - 0022-0000

VL - 80

SP - 1384

EP - 1403

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 7

ER -