"An algorithm for finding a rectangular dual of a planar graph for use in ..."

Krzysztof Kozminski, Edwin Kinnen (1984)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-03-01

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/dac/KozminskiK84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dac/KozminskiK84
Krzysztof Kozminski, Edwin Kinnen:
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits. DAC 1984: 655-656

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.