Finding quasi core with simulated stacked neural networks
type: Item
instance of: scholarly article
title: Finding quasi core with simulated stacked neural networks
zbMATH Open document ID: 1360.05171
author: Malay Bhattacharyya
author: Sanghamitra Bandyopadhyay
published in: Information Sciences
publication date: 2017-05-15T00:00:00Z
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 92B20
zbMATH DE Number: 6715446
zbMATH Keywords: quasi-core
zbMATH Keywords: quasi-clique
zbMATH Keywords: stacked neural network
zbMATH Keywords: real-life network
zbMATH Keywords: bioinformatics
zbMATH Keywords: optimization
describes a project that uses: QUALEX
describes a project that uses: DIMACS
describes a project that uses: darch
describes a project that uses: Algorithm 457
describes a project that uses: clusfind
MaRDI profile type: Publication
full work available at URL: j.ins.2014.09.032
OpenAlex ID: W2077749535
cites work: Q4945528
cites work: Q3044359
cites work: The Enumeration of Maximal Cliques of Large Graphs
cites work: Experiments in quadratic 0-1 programming
cites work: Analyzing topological properties of protein-protein interaction networks: a perspective toward systems biology
cites work: Bounds on Quasi-Completeness
cites work: Q3145799
cites work: Distributed Discovery of Large Near-Cliques
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: A new trust region technique for the maximum weight clique problem
cites work: Q3619797
cites work: Q4942157
cites work: Q4198056
cites work: A simple simulated annealing algorithm for the maximum clique problem
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Reducing the Dimensionality of Data with Neural Networks
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Finding Groups in Data
cites work: Optimization by Simulated Annealing
cites work: Q4472034
cites work: A fast algorithm for the maximum clique problem
cites work: A branch and bound algorithm for the maximum clique problem
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: An algorithm for finding a maximum clique in a graph
DOI: 10.1016/J.INS.2014.09.032
description: scientific article; zbMATH DE number 6715446