A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (Q1578388)

From MaRDI portal
Revision as of 00:08, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
scientific article

    Statements

    title
    A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (English)
    0 references
    author
    Ulrik Brandes
    0 references
    Dorothea Wagner
    0 references
    published in
    Algorithmica
    0 references
    publication date
    27 August 2000
    0 references
    zbMATH Keywords
    Menger problem
    0 references

    Identifiers

    DOI
    10.1007/s004530010029
    0 references
    zbMATH DE Number
    1496831
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1578388&oldid=1896532"
      Powered by MediaWiki