A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357)

From MaRDI portal
Revision as of 08:42, 28 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 bottleneck biconnected spanning subgraph problem
scientific article

    Statements

    A linear time algorithm for the bottleneck biconnected spanning subgraph problem (English)
    0 references
    24 June 2003
    0 references

    Identifiers