"Anytime propagation algorithm for min-based possibilistic graphs."

Nahla Ben Amor, Salem Benferhat, Khaled Mellouli (2003)

> Home

Details and statistics

DOI: 10.1007/S00500-002-0255-X

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/AmorBM03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/AmorBM03
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli:
Anytime propagation algorithm for min-based possibilistic graphs. Soft Comput. 8(2): 150-161 (2003)

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.