The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CoCoNAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Brain Connectivity Toolbox / 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.1186/s13408-015-0027-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1935090183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Energy Conservative Numerical Scheme on Mixed Meshes for the Nonlinear Schrödinger Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5471689 / 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: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of optimization in complex networks. Communication and social networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical cell assembly hypothesis -- Theoretical possibility of spatio-temporal coding in the cortex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of cell assemblies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / 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: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of Maximal Cliques of Large 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: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank

Latest revision as of 23:59, 11 July 2024

scientific article
Language Label Description Also known as
English
The minimal \(k\)-core problem for modeling \(k\)-assemblies
scientific article

    Statements

    The minimal \(k\)-core problem for modeling \(k\)-assemblies (English)
    0 references
    0 references
    0 references
    12 May 2016
    0 references
    0 references
    cell assembly
    0 references
    memory
    0 references
    graph theory
    0 references
    \(k\)-assembly
    0 references
    complexity
    0 references
    \(k\)-core
    0 references
    0 references
    0 references