The graph sandwich problem for 1-join composition is NP-complete

de Figueiredo, CMH, Klein, S and Vuskovic, K (2002) The graph sandwich problem for 1-join composition is NP-complete. Discrete Applied Mathematics, 121 (1-3). 73 - 82 . ISSN 0166-218X

Abstract

Metadata

Authors/Creators:
  • de Figueiredo, CMH
  • Klein, S
  • Vuskovic, K
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 22 Jun 2012 10:17
Last Modified: 16 Sep 2016 14:18
Published Version: http://dx.doi.org/10.1016/S0166-218X(01)00246-3
Status: Published
Publisher: Elsevier for North-Holland Publishing
Identification Number: 10.1016/S0166-218X(01)00246-3

Share / Export

Statistics