Finding quasi core with simulated stacked neural networks
DOI10.1016/J.INS.2014.09.032zbMATH Open1360.05171OpenAlexW2077749535MaRDI QIDQ526647FDOQ526647
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
Applications of graph theory (05C90) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Neural networks for/in biological studies, artificial life and related topics (92B20) Signed and weighted graphs (05C22)
Cites Work
- Finding Groups in Data
- Algorithm 457: finding all cliques of an undirected graph
- Optimization by Simulated Annealing
- Reducing the Dimensionality of Data with Neural Networks
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A fast algorithm for the maximum clique problem
- ``Neural computation of decisions in optimization problems
- The Enumeration of Maximal Cliques of Large Graphs
- A new trust region technique for the maximum weight clique problem
- A branch and bound algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- Experiments in quadratic 0-1 programming
- Principles and Practice of Constraint Programming – CP 2003
- A simple simulated annealing algorithm for the maximum clique problem
- Bounds on Quasi-Completeness
- Analyzing topological properties of protein-protein interaction networks: a perspective toward systems biology
- Distributed Discovery of Large Near-Cliques
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Finding quasi core with simulated stacked neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526647)
