The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q35849147, #quickstatements; #temporary_batch_1706974296281 |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
| 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 | |||
Latest revision as of 21:17, 19 March 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
12 May 2016
0 references
cell assembly
0 references
memory
0 references
graph theory
0 references
\(k\)-assembly
0 references
complexity
0 references
\(k\)-core
0 references
