Finding weighted \(k\)-truss communities in large networks (Q778465): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and effective community search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the problem of reporting maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying molecular sequences using a linkage graph with their pairwise similarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Main-memory triangle computations for very large (sparse (power-law)) graphs / rank
 
Normal rank

Latest revision as of 00:30, 23 July 2024

scientific article
Language Label Description Also known as
English
Finding weighted \(k\)-truss communities in large networks
scientific article

    Statements

    Identifiers