Communication complexity of approximate matching in distributed graphs (Q2955016)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Communication complexity of approximate matching in distributed graphs
scientific article

    Statements

    0 references
    0 references
    0 references
    0 references
    24 January 2017
    0 references
    approximate maximum matching
    0 references
    distributed computation
    0 references
    communication complexity
    0 references
    Communication complexity of approximate matching in distributed graphs (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references