Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation

From MaRDI portal
Publication:1601001
Jump to:navigation, search

DOI10.1007/s00453-001-0105-8zbMath0994.68002OpenAlexW1976886496MaRDI QIDQ1601001

Alberto Bertoni, Giuliano Grossi, Paola Campadelli

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0105-8


zbMATH Keywords

Maximum clique problemneural approximation algorithm


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10)


Related Items (4)

Improvements to MCS algorithm for the maximum clique problem ⋮ Preface ⋮ Speeding up branch and bound algorithms for solving the maximum clique problem ⋮ Solving maximum independent set by asynchronous distributed hopfield-type neural networks


Uses Software

  • DIMACS





This page was built for publication: A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1601001&oldid=13899344"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki