"Parallel Computation of the Minimal Crossing Number of a Graph."

Umid Tadjiev, Frederick C. Harris Jr. (1997)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2003-04-25

- no documents available
- export record
  dblp key:
  - conf/ppsc/TadjievH97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppsc/TadjievH97
Umid Tadjiev, Frederick C. Harris Jr.:
Parallel Computation of the Minimal Crossing Number of a Graph. PPSC 1997

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.