A linear algorithm for bipartition of biconnected graphs (Q911298)

From MaRDI portal
Revision as of 14:06, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear algorithm for bipartition of biconnected graphs
scientific article

    Statements

    title
    A linear algorithm for bipartition of biconnected graphs (English)
    0 references
    author
    Hitoshi Suzuki
    0 references
    Naomi Takahashi
    0 references
    Takao Nishizeki
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    linear algorithm
    0 references
    bipartition of biconnected graphs
    0 references
    depth-first search
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    68W99
    0 references
    zbMATH DE Number
    4141515
    0 references
    OpenAlex ID
    W1997165382
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q911298&oldid=34821995"
    Powered by MediaWiki