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 | |
Publication status | Published - 2014 |
Externally published | Yes |