The Maximum Edge-Disjoint Paths Problem in Bidirected Trees (Q2753529)

From MaRDI portal
Revision as of 15:23, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
scientific article

    Statements

    title
    The Maximum Edge-Disjoint Paths Problem in Bidirected Trees (English)
    0 references
    author
    Erlebach, Thomas
    0 references
    Klaus Jansen
    0 references
    publication date
    11 November 2001
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    edge-disjoint paths
    0 references
    bidirected trees
    0 references

    Identifiers

    zbMATH DE Number
    1670334
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2753529&oldid=15617485"
    Powered by MediaWiki