A Simpler Parallel Algorithm for Graph Connectivity (Q4285909)

From MaRDI portal
Revision as of 22:51, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 536846
Language Label Description Also known as
English
A Simpler Parallel Algorithm for Graph Connectivity
scientific article; zbMATH DE number 536846

    Statements

    title
    A Simpler Parallel Algorithm for Graph Connectivity (English)
    0 references
    author
    Yahiko Kambayashi
    0 references
    Kazuo Iwama
    0 references
    publication date
    19 October 1994
    0 references
    zbMATH Keywords
    graph connectivity
    0 references
    expander graphs
    0 references
    CRCW PRAM algorithm
    0 references
    connected components
    0 references
    undirected graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W15
    0 references
    68Q25
    0 references
    05C40
    0 references
    68R10
    0 references
    zbMATH DE Number
    536846
    0 references
    OpenAlex ID
    W1976398917
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4285909&oldid=32053910"
    Powered by MediaWiki