Parameterized complexity: exponential speed-up for planar graph problems (Q4828563): 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.jalgor.2004.03.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108093643 / rank
 
Normal rank

Latest revision as of 21:36, 19 March 2024

scientific article; zbMATH DE number 2117876
Language Label Description Also known as
English
Parameterized complexity: exponential speed-up for planar graph problems
scientific article; zbMATH DE number 2117876

    Statements

    Parameterized complexity: exponential speed-up for planar graph problems (English)
    0 references
    0 references
    0 references
    0 references
    23 November 2004
    0 references
    Planar graph problems
    0 references
    Fixed-parameter tractability
    0 references
    Parameterized complexity
    0 references
    Tree decomposition
    0 references
    Graph separators
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references