"Minimal Unimodal Decomposition is NP-Hard on Graphs."

Mishal Assif P. K, Yuliy M. Baryshnikov (2025)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2510.05944

access: open

type: Informal or Other Publication

metadata version: 2025-12-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2510-05944
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2510-05944
Mishal Assif P. K, Yuliy M. Baryshnikov:
Minimal Unimodal Decomposition is NP-Hard on Graphs. CoRR abs/2510.05944 (2025)

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.