"Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short ..."

Christos Levcopoulos, Andrzej Lingas (1989)

> Home

Details and statistics

DOI: 10.1007/3-540-51859-2_2

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/oa/LevcopoulosL89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/oa/LevcopoulosL89
Christos Levcopoulos, Andrzej Lingas:
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. Optimal Algorithms 1989: 9-13

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.