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

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 spannin...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 80; no. 7; pp. 1384 - 1403
Main Authors:	Mnich, Matthias, Philip, Geevarghese, Saurabh, Saket, Suchý, Ondřej
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2014
Subjects:	Above-guarantee parameterization Algorithms Algorithms and data structures Blocking Fixed-parameter tractable algorithms Graphs Integers Labels Lower bounds Mathematical analysis Mathematical models Max-Cut λ-extendible properties Algorithms and data structures λ-extendible properties Above-guarantee parameterization Fixed-parameter tractable algorithms Max-Cut
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!