The minimal \(k\)-core problem for modeling \(k\)-assemblies

DOI10.1186/s13408-015-0027-4zbMath1357.92018OpenAlexW1935090183WikidataQ35849147 ScholiaQ35849147MaRDI QIDQ282678

Illya V. Hicks, Cynthia I. Wood

Publication date: 12 May 2016

Published in: The Journal of Mathematical Neuroscience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13408-015-0027-4

zbMATH Keywords

complexitygraph theorymemory\(k\)-assembly\(k\)-corecell assembly

Mathematics Subject Classification ID

Applications of graph theory (05C90) Neural biology (92C20)

Related Items (1)

Minimum k‐cores and the k‐core polytope

Uses Software

• Algorithm 457
• Brain Connectivity Toolbox
• CoCoNAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Handbook of optimization in complex networks. Communication and social networks.
• A note on the problem of reporting maximal cliques
• On associative memory
• Towards a theory of cell assemblies
• Dynamical cell assembly hypothesis -- Theoretical possibility of spatio-temporal coding in the cortex
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• A graph‐theoretic generalization of the clique concept
• The Enumeration of Maximal Cliques of Large Graphs
• Algorithm 457: finding all cliques of an undirected graph
• An Energy Conservative Numerical Scheme on Mixed Meshes for the Nonlinear Schrödinger Equation
• On cliques in graphs

This page was built for publication: The minimal \(k\)-core problem for modeling \(k\)-assemblies