New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (Q4606313)

From MaRDI portal
Revision as of 14:48, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6846413
Language Label Description Also known as
English
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
scientific article; zbMATH DE number 6846413

    Statements

    0 references
    0 references
    0 references
    2 March 2018
    0 references
    disjoint paths
    0 references
    approximation algorithms
    0 references
    feedback vertex set
    0 references
    New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (English)
    0 references

    Identifiers

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