Neighborhood principle driven ICF algorithm and graph distance calculations (Q2898777)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Neighborhood principle driven ICF algorithm and graph distance calculations |
scientific article; zbMATH DE number 6054952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighborhood principle driven ICF algorithm and graph distance calculations |
scientific article; zbMATH DE number 6054952 |
Statements
12 July 2012
0 references
iterative canonical form
0 references
ICF
0 references
ICF-graph
0 references
Boolean function
0 references
Boolean algebra
0 references
graph distance
0 references
graph metrics
0 references
biological applications
0 references
0.8386937
0 references
0 references
0 references
0.83525336
0 references
0.8346871
0 references
Neighborhood principle driven ICF algorithm and graph distance calculations (English)
0 references