On the polynomiality of finding K DMDGP re-orders

Abstract : In [6], the complexity of finding K DMDGP reorders was stated to be NP-complete by inclusion, which fails to provide a complete picture. In this paper we show that this problem is indeed NP-complete for K = 1, but it is in P for each fixed K ≥ 2.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02350277
Contributor : Leo Liberti <>
Submitted on : Wednesday, November 6, 2019 - 5:30:54 AM
Last modification on : Friday, November 8, 2019 - 1:39:40 AM

File

dam19.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Carlile Lavor, Michael Souza, Luiz Mariano Carvalho, Leo Liberti. On the polynomiality of finding K DMDGP re-orders. Discrete Applied Mathematics, Elsevier, 2019, 267, pp.190-194. ⟨10.1016/j.dam.2019.07.021⟩. ⟨hal-02350277⟩

Share

Metrics

Record views

8

Files downloads

16