Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: WebGraph / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pajek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UbiCrawler / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016311778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes for the World Wide Web / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupling Scale-Free and Classical Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network analysis. Methodological foundations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radix Sorting with No Extra Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix measures for transitivity and balance* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Main-memory triangle computations for very large (sparse (power-law)) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Clustering Coefficient and Transitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 28 June 2024

scientific article
Language Label Description Also known as
English
Main-memory triangle computations for very large (sparse (power-law)) graphs
scientific article

    Statements

    Main-memory triangle computations for very large (sparse (power-law)) graphs (English)
    0 references
    0 references
    18 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    graphs
    0 references
    algorithms
    0 references
    triangles
    0 references
    complex networks
    0 references
    0 references
    0 references
    0 references
    0 references