COUNTING LIST MATRIX PARTITIONS OF GRAPHS
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1960
- Type
- D - Journal article
- DOI
-
10.1137/140963029
- Title of journal
- SIAM JOURNAL ON COMPUTING
- Article number
- -
- First page
- 1089
- Volume
- 44
- Issue
- 4
- ISSN
- 0097-5397
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2015
- 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
-
4
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This SICOMP paper extends a conference version in CCC�14. List matrix partitions give a way to encode important graph-theoretic structures in terms of a matrix (see reference [15]). Determining for which matrices the list matrix partition problem is tractable fits into a major international research programme with the goal of delineating the boundaries of tractability (this includes Goldberg�s ERC grant). Several partial classifications have been given (see [15]) but prior work on list matrix partition counting problems only provided classifications for matrices with up to 3 rows and columns. This paper achieves a full complexity classification for all matrices.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -