Finding quasi core with simulated stacked neural networks

DOI10.1016/j.ins.2014.09.032zbMath1360.05171OpenAlexW2077749535MaRDI QIDQ526647

Sanghamitra Bandyopadhyay, Malay Bhattacharyya

Publication date: 15 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.09.032

zbMATH Keywords

optimizationbioinformaticsquasi-cliquequasi-corereal-life networkstacked neural network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Neural networks for/in biological studies, artificial life and related topics (92B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Signed and weighted graphs (05C22)

Related Items (1)

Efficient temporal core maintenance of massive graphs

Uses Software

• QUALEX
• DIMACS
• darch
• Algorithm 457
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• ``Neural computation of decisions in optimization problems
• Experiments in quadratic 0-1 programming
• An algorithm for finding a maximum clique in a graph
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• A fast algorithm for the maximum clique problem
• A new trust region technique for the maximum weight clique problem
• A simple simulated annealing algorithm for the maximum clique problem
• Bounds on Quasi-Completeness
• Reducing the Dimensionality of Data with Neural Networks
• Distributed Discovery of Large Near-Cliques
• Finding Groups in Data
• The Enumeration of Maximal Cliques of Large Graphs
• Algorithm 457: finding all cliques of an undirected graph
• Principles and Practice of Constraint Programming – CP 2003
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: Finding quasi core with simulated stacked neural networks