On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663)

From MaRDI portal
Revision as of 23:07, 1 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6864492
Language Label Description Also known as
English
On Algorithms Employing Treewidth for $L$-bounded Cut Problems
scientific article; zbMATH DE number 6864492

    Statements

    On Algorithms Employing Treewidth for $L$-bounded Cut Problems (English)
    0 references
    0 references
    25 April 2018
    0 references
    approximation algorithm
    0 references

    Identifiers

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