Kratsch, D., Muller, H. and Todinca, I. (2008) Feedback vertex set on AT-free graphs. Discrete Applied Mathematics, 156 (10). pp. 1936-1947. ISSN 0166-218X
Abstract
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.
Metadata
| Authors/Creators: |
|
|---|---|
| Dates: |
|
| Institution: | The University of Leeds |
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
| Depositing User: | Sherpa Assistant |
| Date Deposited: | 04 Sep 2008 13:55 |
| Last Modified: | 18 Jun 2015 17:26 |
| Published Version: | http://dx.doi.org/10.1016/j.dam.2007.10.006 |
| Status: | Published |
| Publisher: | Elsevier Science BV |
| Refereed: | Yes |
| Identification Number: | https://doi.org/10.1016/j.dam.2007.10.006 |
Download not available
A full text copy of this item is not currently available from White Rose Research Online
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)