Solving Problems on Graphs of High Rank-Width
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 35187397
- Type
- D - Journal article
- DOI
-
10.1007/s00453-017-0290-8
- Title of journal
- Algorithmica
- Article number
- -
- First page
- 742
- Volume
- 80
- Issue
- -
- ISSN
- 0178-4617
- Open access status
- Compliant
- Month of publication
- February
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper introduces a novel family of structural parameters that combine two orthogonal approaches to measure structure of instances -- Width parameters and Modulators. We show that these combined parameters are strictly more general and cover instances not covered by a single approach. Our main result is an algorithmic meta-theorem giving an fixed parameter algorithm parameterized by our new parameters for all problems expressible in a specific logic covering many natural problems.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -