Beyond Max-Cut: ?-Extendible Properties Parameterized Above the Poljak-Turzík Bound
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00221005" target="_blank" >RIV/68407700:21240/14:00221005 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0022000014000555" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0022000014000555</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2014.04.011" target="_blank" >10.1016/j.jcss.2014.04.011</a>
Alternative languages
Result language
angličtina
Original language name
Beyond Max-Cut: ?-Extendible Properties Parameterized Above the Poljak-Turzík Bound
Original language description
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(?) 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 Helement? and H has at least ?m+(1-?)/2*(n-1)+k edges?is fixed-parameter tractable (FPT) for all 0<?<1, for all strongly ?-extendible graph properties ? for which the APT(?) problemis FPT on graphs which are O(k) vertices away from being a graph in which each block is a clique. Our results hold for properties of oriented graphs and graphs with edge labels, generalize the recent result of Crowston et al. (ICALP 2012) on Max-Cut parameterized above the Edwards?Erdős bound, and yield FPT algorithms for several graph problems parameterized above lower bounds.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Computer and System Sciences
ISSN
0022-0000
e-ISSN
—
Volume of the periodical
80
Issue of the periodical within the volume
7
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
20
Pages from-to
1384-1403
UT code for WoS article
000336882100014
EID of the result in the Scopus database
—