Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5894040)

From MaRDI portal
Revision as of 11:53, 8 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5839865
Language Label Description Also known as
English
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
scientific article; zbMATH DE number 5839865

    Statements

    Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2011
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references