"A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem ..."

Ahmad Biniaz et al. (2016)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2017-03-08

- no documents available
- export record
  dblp key:
  - conf/cccg/BiniazBDMS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/BiniazBDMS16
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146

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.