An approximation algorithm for graph partitioning via deterministic annealing neural network

Published 2019 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An approximation algorithm for graph partitioning via deterministic annealing neural network
Authors
Keywords
Graph partitioning, Neural network, Combinatorial optimization, NP-hard problem, Deterministic annealing neural network algorithm
Journal
NEURAL NETWORKS
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2019-05-18
DOI
10.1016/j.neunet.2019.05.010

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.