The minimal \(k\)-core problem for modeling \(k\)-assemblies
type: Item
instance of: scholarly article
title: The minimal \(k\)-core problem for modeling \(k\)-assemblies
zbMATH Open document ID: 1357.92018
author: Cynthia I. Wood
author: Illya V. Hicks
published in: The Journal of Mathematical Neuroscience
publication date: 2016-05-12T00:00:00Z
Mathematics Subject Classification ID: 92C20
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6579833
zbMATH Keywords: cell assembly
zbMATH Keywords: memory
zbMATH Keywords: graph theory
zbMATH Keywords: \(k\)-assembly
zbMATH Keywords: complexity
zbMATH Keywords: \(k\)-core
Wikidata QID: Q35849147
describes a project that uses: Algorithm 457
describes a project that uses: CoCoNAD
describes a project that uses: Brain Connectivity Toolbox
MaRDI profile type: Publication
full work available at URL: s13408-015-0027-4
OpenAlex ID: W1935090183
cites work: Q4397004
cites work: An Energy Conservative Numerical Scheme on Mixed Meshes for the Nonlinear Schrödinger Equation
cites work: Q5471689
cites work: A graph‐theoretic generalization of the clique concept
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Handbook of optimization in complex networks. Communication and social networks.
cites work: On associative memory
cites work: Dynamical cell assembly hypothesis -- Theoretical possibility of spatio-temporal coding in the cortex
cites work: Towards a theory of cell assemblies
cites work: Q4198056
cites work: The complexity of computing the permanent
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: On cliques in graphs
cites work: The Enumeration of Maximal Cliques of Large Graphs
cites work: A note on the problem of reporting maximal cliques
cites work: Q5585020
cites work: Introduction to algorithms
DOI: 10.1186/S13408-015-0027-4
Recommended article: Minimum k‐cores and the k‐core polytope
Recommended article: A polytope approach to the optimal assembly problem
Recommended article: A simple solution to the k‐core problem
Recommended article: A simple lower bound to the dynamic assembly problem
Recommended article: On the chance-constrained minimum spanning \(k\)-core problem
Recommended article: Mathematical programming formulations for the collapsed k-core problem
Recommended article: On the largest part size of low‐rank combinatorial assemblies
Recommended article: \(k\)-center problems with minimum coverage
Recommended article: Computing and Combinatorics
Recommended article: Q4862297
description: scientific article; zbMATH DE number 6579833