"Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge ..."

David Eppstein, Michael T. Goodrich, Darren Strash (2010)

> Home

Details and statistics

DOI: 10.1137/090759112

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/EppsteinGS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/EppsteinGS10
David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39(8): 3814-3829 (2010)

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.