"There Are Planar Graphs Almost as Good as the Complete Graphs and Almost ..."

Christos Levcopoulos, Andrzej Lingas (1992)

> Home

Details and statistics

DOI: 10.1007/BF01758846

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/LevcopoulosL92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/LevcopoulosL92
Christos Levcopoulos, Andrzej Lingas:
There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. Algorithmica 8(3): 251-256 (1992)

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.