Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Approximating a solution of the s-t max-cut problem with a deterministic ..."

Chuangyin Dang (2000)

> Home

Details and statistics

DOI: 10.1016/S0893-6080(00)00064-2

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/nn/Dang00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/nn/Dang00
Chuangyin Dang:
Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm. Neural Networks 13(7): 801-810 (2000)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.