Linear Clique-Width for Hereditary Classes of Cographs
- Submitting institution
-
University of Derby
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 783996-1
- Type
- D - Journal article
- DOI
-
10.1002/jgt.22037
- Title of journal
- Journal of Graph Theory
- Article number
- -
- First page
- 501
- Volume
- 84
- Issue
- 4
- ISSN
- 0364-9024
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2016
- URL
-
https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.22037
- 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
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This multidisciplinary article (on graphs and permutations) had significant impact on further research into algorithmically motivated graph parameters: it was applied directly in building a general hierarchy of graph parameters for all graphs, using cographs as the special pivot-case (Alecu, Lozin, de Werra). Through a sequence of further papers, it helped mathematicians detect four critical classes of graphs for distinguishing the difference between bounded linear clique-width and bounded clique-width as tools for deducing linear-time solvability of infinitely many algorithmic problems (Alecu, Kanté, Lozin, Zamaraev).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
