\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.09.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977262817 / rank
 
Normal rank

Revision as of 02:58, 20 March 2024

scientific article
Language Label Description Also known as
English
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
scientific article

    Statements

    \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    algorithms
    0 references
    graphs
    0 references
    parameterized
    0 references
    independent set
    0 references
    rank-width
    0 references
    0 references