"Minimising line segments in linear diagrams is NP-hard."

Peter Chapman, Kevin Sim, Huang Hao Chen (2022)

> Home

Details and statistics

DOI: 10.1016/J.COLA.2022.101136

access: closed

type: Journal Article

metadata version: 2022-09-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/vlc/ChapmanSC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vlc/ChapmanSC22
Peter Chapman, Kevin Sim, Huang Hao Chen:
Minimising line segments in linear diagrams is NP-hard. J. Comput. Lang. 71: 101136 (2022)

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.