A Linear-Time Algorithm to Find a Separator in a Graph Excluding a Minor

    Thumbnail
    Citations
    Scopus
    Web of Science
    Altmetric
    17
    12
    Author
    Reed, B; Wood, DR
    Date
    2009-10-01
    Source Title
    ACM TRANSACTIONS ON ALGORITHMS
    Publisher
    ASSOC COMPUTING MACHINERY
    University of Melbourne Author/s
    WOOD, DAVID
    Affiliation
    Mathematics and Statistics
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Reed, B. & Wood, D. R. (2009). A Linear-Time Algorithm to Find a Separator in a Graph Excluding a Minor. ACM TRANSACTIONS ON ALGORITHMS, 5 (4), https://doi.org/10.1145/1597036.1597043.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/29373
    DOI
    10.1145/1597036.1597043
    Keywords
    Computation Theory and Mathematics

    Export Reference in RIS Format     

    Collections