Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time (Q6090913)

From MaRDI portal
scientific article; zbMATH DE number 7768400
Language Label Description Also known as
English
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time
scientific article; zbMATH DE number 7768400

    Statements

    0 references
    0 references
    0 references
    20 November 2023
    0 references
    sublinear time algorithms
    0 references
    graph algorithms
    0 references
    sampling subgraphs
    0 references
    approximate counting
    0 references
    Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time (English)
    0 references

    Identifiers

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