Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket (2014) Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width SIAM Journal on Computing, 43 (5). pp. 1541-1563. ISSN 0097-5397
Full text not available from this repository.
Official URL: http://doi.org/10.1137/130910932
Related URL: http://dx.doi.org/10.1137/130910932
Abstract
We obtain asymptotically tight algorithmic bounds for Max-Cut and Edge Dominating Set problems on graphs of bounded clique-width.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Society for Industrial and Applied Mathematics. |
| ID Code: | 123429 |
| Deposited On: | 16 Sep 2021 11:04 |
| Last Modified: | 16 Sep 2021 11:04 |
Repository Staff Only: item control page
