Fast maximal cliques enumeration in sparse graphs (Q1949748): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of 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 New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Revision as of 10:17, 6 July 2024

scientific article
Language Label Description Also known as
English
Fast maximal cliques enumeration in sparse graphs
scientific article

    Statements

    Identifiers