"k-Level Crossing Minimization Is NP-Hard for Trees."

Martin Harrigan, Patrick Healy (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-19094-0_9

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/HarriganH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/HarriganH11
Martin Harrigan, Patrick Healy:
k-Level Crossing Minimization Is NP-Hard for Trees. WALCOM 2011: 70-76

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.