A characterisation of clique-width through nested partitions (Q2348055): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.02.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995739513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and edge contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the verification of monadic second-order graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations characterizing rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear layouts measuring neighbourhoods in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of linear clique-width at most 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Approach to Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative clique-width of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a disparity between relative cliquewidth and relative NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank

Latest revision as of 04:40, 10 July 2024

scientific article
Language Label Description Also known as
English
A characterisation of clique-width through nested partitions
scientific article

    Statements

    A characterisation of clique-width through nested partitions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2015
    0 references
    clique-width
    0 references
    linear clique-width
    0 references
    characterisation
    0 references
    efficient representation
    0 references

    Identifiers