"Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in ..."

Václav Skala, Michal Smolik (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-24289-3_27

access: closed

type: Conference or Workshop Paper

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iccsa/SkalaS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccsa/SkalaS19
Václav Skala, Michal Smolik:
Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN). ICCSA (1) 2019: 367-380

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.