A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.10.014 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / 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: Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs / 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: Fast maximal cliques enumeration in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound on maximal clique listing via rectangular fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Sets and Bicliques in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Arboricity to Determine the Local Structure of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / 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
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.10.014 / rank
 
Normal rank

Latest revision as of 07:23, 11 December 2024

scientific article
Language Label Description Also known as
English
A new decomposition technique for maximal clique enumeration for sparse graphs
scientific article

    Statements

    A new decomposition technique for maximal clique enumeration for sparse graphs (English)
    0 references
    0 references
    2 May 2019
    0 references
    enumeration
    0 references
    counting
    0 references
    algorithms
    0 references
    maximal cliques
    0 references
    \(k\)-degenerate graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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