"An $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm ..."

Mehdi Ghiyasvand (2019)

> Home

Details and statistics

DOI: 10.1007/S10878-018-0331-5

access: closed

type: Journal Article

metadata version: 2019-03-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Ghiyasvand19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Ghiyasvand19
Mehdi Ghiyasvand:
An $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem. J. Comb. Optim. 37(3): 957-969 (2019)

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.