Skip to main navigation Skip to search Skip to main content

k-level crossing minimization is NP-hard for trees

  • University College Dublin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Fingerprint

Dive into the research topics of 'k-level crossing minimization is NP-hard for trees'. Together they form a unique fingerprint.
Sort by

Mathematics

Computer Science