Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,902,585 edits
‎Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01293664 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093476384 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
scientific article

    Statements

    title
    Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    9 October 1995
    0 references
    zbMATH Keywords
    tree-decomposable graphs
    0 references
    dynamic programming
    0 references
    polynomial-time algorithms
    0 references
    author
    Richard B. Borie
    0 references
    cites work
    Q3029044
    0 references
    Q4734761
    0 references
    Q3975133
    0 references
    Q4385531
    0 references
    Q4873832
    0 references
    Q4711083
    0 references
    Q3785978
    0 references
    Q4036591
    0 references
    Q3924253
    0 references
    Q3766846
    0 references
    Q3692864
    0 references
    Q4873776
    0 references
    Q4873691
    0 references
    Q3822197
    0 references
    Q3826618
    0 references
    Q3740231
    0 references

    Identifiers

    DOI
    10.1007/BF01293664
    0 references
    zbMATH DE Number
    803778
    0 references
    OpenAlex ID
    W2093476384
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1899445&oldid=37418817"
    Powered by MediaWiki