Branch decompositions and minor containment (Q4446913): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.10099 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998477972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive linear time algorithms for branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank

Latest revision as of 13:43, 6 June 2024

scientific article; zbMATH DE number 2037563
Language Label Description Also known as
English
Branch decompositions and minor containment
scientific article; zbMATH DE number 2037563

    Statements

    Branch decompositions and minor containment (English)
    0 references
    0 references
    0 references
    3 February 2004
    0 references
    graph minor
    0 references
    branchwidth
    0 references
    branch decomposition
    0 references
    minor containment
    0 references
    dynamic programming
    0 references
    obstruction set
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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