Neighborhood principle driven ICF algorithm and graph distance calculations

MaRDI QIDQ2898777zbMATH OpenFDO

Authors Norbert Kézdi, Katalin Pásztor Varga, Éena Jakó

Publication date 12 July 2012

Published in Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica (Search for Journal in Brave)

zbMATH Keywords

biological applicationsBoolean algebraBoolean functiongraph distancegraph metricsICFICF-graphiterative canonical form

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Boolean functions (06E30)

Recommendations

• On computing the nearest neighbor interchange distance
• A computationally efficient approximation to the nearest neighbor interchange metric
• scientific article; zbMATH DE number 1186103
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• An almost naive algorithm for finding relative neighbourhood graphs in L_p metrics
• Distance neighbourhood domination in graphs
• Distance neighbourhood pattern matrices in a graph

This page was built for publication: Neighborhood principle driven ICF algorithm and graph distance calculations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898777)