๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A multi-KP modeling for the maximum-clique problem

โœ Scribed by Federico Della Croce; Roberto Tadei

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
478 KB
Volume
73
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A neural network model for finding a nea
A neural network model for finding a near-maximum clique
โœ Nubuo Funabiki; Yoshiyasu Takefuji; Kuo-Chun Lee ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm r

Bifurcation for a free boundary problem
Bifurcation for a free boundary problem modeling the growth of multi-layer tumors
โœ Fujun Zhou; Shangbin Cui ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 359 KB

In this paper we study bifurcations for a free boundary problem modeling the growth of multi-layer tumors under the action of inhibitors. An important feature of this problem is that the surface tension effect of the free boundary is taken into account. By reducing this problem into an abstract bifu